./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/packet_filter.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../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-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 13:01:39,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 13:01:39,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 13:01:39,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 13:01:39,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 13:01:39,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 13:01:39,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 13:01:39,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 13:01:39,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 13:01:39,497 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 13:01:39,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 13:01:39,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 13:01:39,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 13:01:39,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 13:01:39,501 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 13:01:39,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 13:01:39,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 13:01:39,502 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 13:01:39,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 13:01:39,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 13:01:39,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 13:01:39,506 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 13:01:39,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 13:01:39,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 13:01:39,507 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 13:01:39,507 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 13:01:39,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 13:01:39,508 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 13:01:39,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 13:01:39,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 13:01:39,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 13:01:39,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 13:01:39,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:01:39,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 13:01:39,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 13:01:39,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 13:01:39,510 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 13:01:39,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 13:01:39,510 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 13:01:39,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 13:01:39,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 13:01:39,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 13:01:39,512 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-18 13:01:39,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 13:01:39,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 13:01:39,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 13:01:39,799 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 13:01:39,800 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 13:01:39,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/packet_filter.i [2024-11-18 13:01:41,234 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 13:01:41,477 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 13:01:41,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/packet_filter.i [2024-11-18 13:01:41,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/556320098/5ade8ddbdb0447f490997c396b8fc940/FLAG7c1c8d01f [2024-11-18 13:01:41,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/556320098/5ade8ddbdb0447f490997c396b8fc940 [2024-11-18 13:01:41,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 13:01:41,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 13:01:41,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 13:01:41,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 13:01:41,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 13:01:41,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:01:41" (1/1) ... [2024-11-18 13:01:41,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79025723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:41, skipping insertion in model container [2024-11-18 13:01:41,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:01:41" (1/1) ... [2024-11-18 13:01:41,570 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 13:01:41,877 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-18 13:01:41,885 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-18 13:01:41,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:01:41,898 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 13:01:41,941 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-18 13:01:41,943 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-18 13:01:41,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:01:41,991 INFO L204 MainTranslator]: Completed translation [2024-11-18 13:01:41,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:41 WrapperNode [2024-11-18 13:01:41,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 13:01:41,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 13:01:41,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 13:01:41,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 13:01:41,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:41" (1/1) ... [2024-11-18 13:01:42,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:41" (1/1) ... [2024-11-18 13:01:42,035 INFO L138 Inliner]: procedures = 130, calls = 85, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2024-11-18 13:01:42,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 13:01:42,037 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 13:01:42,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 13:01:42,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 13:01:42,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:41" (1/1) ... [2024-11-18 13:01:42,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:41" (1/1) ... [2024-11-18 13:01:42,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:41" (1/1) ... [2024-11-18 13:01:42,076 INFO L175 MemorySlicer]: Split 57 memory accesses to 7 slices as follows [2, 6, 6, 6, 16, 15, 6]. 28 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 0, 0, 0, 3, 2]. The 14 writes are split as follows [0, 3, 3, 3, 4, 0, 1]. [2024-11-18 13:01:42,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:41" (1/1) ... [2024-11-18 13:01:42,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:41" (1/1) ... [2024-11-18 13:01:42,093 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:41" (1/1) ... [2024-11-18 13:01:42,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:41" (1/1) ... [2024-11-18 13:01:42,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:41" (1/1) ... [2024-11-18 13:01:42,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:41" (1/1) ... [2024-11-18 13:01:42,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 13:01:42,113 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 13:01:42,114 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 13:01:42,114 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 13:01:42,115 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:41" (1/1) ... [2024-11-18 13:01:42,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:01:42,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:01:42,152 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-18 13:01:42,155 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-18 13:01:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 13:01:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 13:01:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-18 13:01:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-18 13:01:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-18 13:01:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-18 13:01:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-18 13:01:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-18 13:01:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-18 13:01:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-18 13:01:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-18 13:01:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-18 13:01:42,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-18 13:01:42,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-18 13:01:42,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-18 13:01:42,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 13:01:42,204 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2024-11-18 13:01:42,204 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2024-11-18 13:01:42,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-18 13:01:42,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-18 13:01:42,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-18 13:01:42,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-18 13:01:42,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-18 13:01:42,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-18 13:01:42,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-18 13:01:42,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 13:01:42,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-18 13:01:42,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-18 13:01:42,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-18 13:01:42,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-18 13:01:42,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-18 13:01:42,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-18 13:01:42,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-18 13:01:42,207 INFO L130 BoogieDeclarations]: Found specification of procedure send [2024-11-18 13:01:42,208 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2024-11-18 13:01:42,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 13:01:42,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-18 13:01:42,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-18 13:01:42,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-18 13:01:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-18 13:01:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-18 13:01:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-18 13:01:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-18 13:01:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 13:01:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 13:01:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-18 13:01:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-18 13:01:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-18 13:01:42,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-18 13:01:42,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-18 13:01:42,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 13:01:42,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 13:01:42,367 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 13:01:42,374 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 13:01:42,701 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-18 13:01:42,702 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 13:01:42,717 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 13:01:42,717 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-18 13:01:42,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:01:42 BoogieIcfgContainer [2024-11-18 13:01:42,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 13:01:42,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 13:01:42,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 13:01:42,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 13:01:42,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:01:41" (1/3) ... [2024-11-18 13:01:42,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c40d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:01:42, skipping insertion in model container [2024-11-18 13:01:42,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:01:41" (2/3) ... [2024-11-18 13:01:42,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c40d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:01:42, skipping insertion in model container [2024-11-18 13:01:42,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:01:42" (3/3) ... [2024-11-18 13:01:42,724 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter.i [2024-11-18 13:01:42,738 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 13:01:42,739 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-18 13:01:42,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 13:01:42,805 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;@5fcf503f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 13:01:42,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-18 13:01:42,809 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-18 13:01:42,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-18 13:01:42,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:42,815 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:01:42,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:42,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:42,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1092262807, now seen corresponding path program 1 times [2024-11-18 13:01:42,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:42,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81298815] [2024-11-18 13:01:42,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:42,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:43,063 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-18 13:01:43,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:43,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81298815] [2024-11-18 13:01:43,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81298815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:01:43,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:01:43,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 13:01:43,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529771394] [2024-11-18 13:01:43,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:01:43,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 13:01:43,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:43,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 13:01:43,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 13:01:43,093 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-18 13:01:43,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:43,110 INFO L93 Difference]: Finished difference Result 76 states and 99 transitions. [2024-11-18 13:01:43,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 13:01:43,113 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-18 13:01:43,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:43,121 INFO L225 Difference]: With dead ends: 76 [2024-11-18 13:01:43,121 INFO L226 Difference]: Without dead ends: 42 [2024-11-18 13:01:43,124 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-18 13:01:43,129 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-18 13:01:43,130 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-18 13:01:43,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-18 13:01:43,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-18 13:01:43,162 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-18 13:01:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2024-11-18 13:01:43,165 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 8 [2024-11-18 13:01:43,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:43,166 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-18 13:01:43,166 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-18 13:01:43,166 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2024-11-18 13:01:43,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-18 13:01:43,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:43,167 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:01:43,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 13:01:43,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:43,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:43,169 INFO L85 PathProgramCache]: Analyzing trace with hash 353124844, now seen corresponding path program 1 times [2024-11-18 13:01:43,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:43,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457436822] [2024-11-18 13:01:43,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:43,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 13:01:43,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:43,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457436822] [2024-11-18 13:01:43,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457436822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:01:43,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:01:43,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 13:01:43,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606281558] [2024-11-18 13:01:43,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:01:43,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 13:01:43,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:43,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 13:01:43,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 13:01:43,408 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-18 13:01:43,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:43,492 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2024-11-18 13:01:43,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 13:01:43,493 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-18 13:01:43,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:43,495 INFO L225 Difference]: With dead ends: 77 [2024-11-18 13:01:43,495 INFO L226 Difference]: Without dead ends: 54 [2024-11-18 13:01:43,496 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-18 13:01:43,499 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-18 13:01:43,500 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-18 13:01:43,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-18 13:01:43,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2024-11-18 13:01:43,511 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-18 13:01:43,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2024-11-18 13:01:43,513 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 9 [2024-11-18 13:01:43,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:43,514 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2024-11-18 13:01:43,514 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-18 13:01:43,514 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2024-11-18 13:01:43,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-18 13:01:43,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:43,515 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:01:43,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 13:01:43,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:43,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:43,517 INFO L85 PathProgramCache]: Analyzing trace with hash 380446450, now seen corresponding path program 1 times [2024-11-18 13:01:43,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:43,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157292597] [2024-11-18 13:01:43,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:43,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:43,688 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-18 13:01:43,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:43,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157292597] [2024-11-18 13:01:43,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157292597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:01:43,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:01:43,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 13:01:43,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469589158] [2024-11-18 13:01:43,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:01:43,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 13:01:43,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:43,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 13:01:43,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 13:01:43,690 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-18 13:01:43,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:43,753 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2024-11-18 13:01:43,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 13:01:43,754 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-18 13:01:43,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:43,755 INFO L225 Difference]: With dead ends: 69 [2024-11-18 13:01:43,756 INFO L226 Difference]: Without dead ends: 52 [2024-11-18 13:01:43,757 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-18 13:01:43,758 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-18 13:01:43,761 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-18 13:01:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-18 13:01:43,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2024-11-18 13:01:43,770 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-18 13:01:43,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2024-11-18 13:01:43,771 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 12 [2024-11-18 13:01:43,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:43,771 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2024-11-18 13:01:43,771 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-18 13:01:43,771 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2024-11-18 13:01:43,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-18 13:01:43,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:43,772 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-18 13:01:43,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 13:01:43,773 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:43,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:43,774 INFO L85 PathProgramCache]: Analyzing trace with hash 707816306, now seen corresponding path program 1 times [2024-11-18 13:01:43,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:43,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505558404] [2024-11-18 13:01:43,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:43,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:43,937 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-18 13:01:43,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:43,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505558404] [2024-11-18 13:01:43,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505558404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:01:43,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:01:43,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 13:01:43,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3534918] [2024-11-18 13:01:43,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:01:43,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 13:01:43,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:43,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 13:01:43,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:01:43,940 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) 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-18 13:01:43,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:43,972 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2024-11-18 13:01:43,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 13:01:43,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) 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-18 13:01:43,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:43,974 INFO L225 Difference]: With dead ends: 50 [2024-11-18 13:01:43,976 INFO L226 Difference]: Without dead ends: 48 [2024-11-18 13:01:43,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 13:01:43,977 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:01:43,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:01:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-18 13:01:43,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-18 13:01:43,989 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-18 13:01:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2024-11-18 13:01:43,992 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 20 [2024-11-18 13:01:43,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:43,993 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-11-18 13:01:43,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) 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-18 13:01:43,993 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2024-11-18 13:01:43,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-18 13:01:43,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:43,995 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-18 13:01:43,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 13:01:43,995 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:43,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:43,996 INFO L85 PathProgramCache]: Analyzing trace with hash 707818228, now seen corresponding path program 1 times [2024-11-18 13:01:43,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:43,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642305162] [2024-11-18 13:01:43,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:43,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:45,335 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-18 13:01:45,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:45,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642305162] [2024-11-18 13:01:45,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642305162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:01:45,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:01:45,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-18 13:01:45,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387588651] [2024-11-18 13:01:45,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:01:45,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 13:01:45,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:45,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 13:01:45,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-18 13:01:45,339 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 10 states, 9 states have (on average 2.0) 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-18 13:01:46,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:46,075 INFO L93 Difference]: Finished difference Result 93 states and 118 transitions. [2024-11-18 13:01:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-18 13:01:46,075 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) 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-18 13:01:46,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:46,081 INFO L225 Difference]: With dead ends: 93 [2024-11-18 13:01:46,082 INFO L226 Difference]: Without dead ends: 69 [2024-11-18 13:01:46,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-11-18 13:01:46,083 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 17 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 13:01:46,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 317 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 13:01:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-18 13:01:46,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2024-11-18 13:01:46,096 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-18 13:01:46,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2024-11-18 13:01:46,099 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 20 [2024-11-18 13:01:46,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:46,099 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2024-11-18 13:01:46,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) 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-18 13:01:46,099 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2024-11-18 13:01:46,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-18 13:01:46,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:46,100 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-18 13:01:46,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 13:01:46,100 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:46,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:46,101 INFO L85 PathProgramCache]: Analyzing trace with hash -626681606, now seen corresponding path program 1 times [2024-11-18 13:01:46,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:46,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340501711] [2024-11-18 13:01:46,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:46,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:46,511 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-18 13:01:46,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:46,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340501711] [2024-11-18 13:01:46,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340501711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:01:46,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618832635] [2024-11-18 13:01:46,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:46,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:01:46,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:01:46,514 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-18 13:01:46,515 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-18 13:01:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:46,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-18 13:01:46,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:01:46,786 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-18 13:01:47,000 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-18 13:01:47,001 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:01:47,105 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#6.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_309) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#6.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_308) |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-18 13:01:47,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618832635] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:01:47,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:01:47,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2024-11-18 13:01:47,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617487719] [2024-11-18 13:01:47,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:01:47,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 13:01:47,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:47,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 13:01:47,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2024-11-18 13:01:47,113 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-18 13:01:47,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:47,282 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2024-11-18 13:01:47,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 13:01:47,283 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-18 13:01:47,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:47,287 INFO L225 Difference]: With dead ends: 93 [2024-11-18 13:01:47,287 INFO L226 Difference]: Without dead ends: 69 [2024-11-18 13:01:47,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2024-11-18 13:01:47,288 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 10 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:01:47,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 200 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 13:01:47,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-18 13:01:47,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2024-11-18 13:01:47,304 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-18 13:01:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2024-11-18 13:01:47,305 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 21 [2024-11-18 13:01:47,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:47,305 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2024-11-18 13:01:47,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-18 13:01:47,305 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2024-11-18 13:01:47,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-18 13:01:47,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:47,306 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-18 13:01:47,327 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-18 13:01:47,506 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-18 13:01:47,507 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:47,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:47,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1015269178, now seen corresponding path program 1 times [2024-11-18 13:01:47,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:47,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241200044] [2024-11-18 13:01:47,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:47,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:48,151 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-18 13:01:48,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:48,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241200044] [2024-11-18 13:01:48,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241200044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:01:48,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:01:48,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-18 13:01:48,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913534503] [2024-11-18 13:01:48,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:01:48,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 13:01:48,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:48,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 13:01:48,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-18 13:01:48,154 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) 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-18 13:01:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:48,503 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2024-11-18 13:01:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-18 13:01:48,503 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) 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-18 13:01:48,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:48,505 INFO L225 Difference]: With dead ends: 88 [2024-11-18 13:01:48,505 INFO L226 Difference]: Without dead ends: 86 [2024-11-18 13:01:48,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-18 13:01:48,506 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 13 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 13:01:48,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 397 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 13:01:48,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-18 13:01:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2024-11-18 13:01:48,520 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-18 13:01:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 98 transitions. [2024-11-18 13:01:48,521 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 98 transitions. Word has length 21 [2024-11-18 13:01:48,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:48,521 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 98 transitions. [2024-11-18 13:01:48,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) 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-18 13:01:48,522 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 98 transitions. [2024-11-18 13:01:48,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-18 13:01:48,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:48,523 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-18 13:01:48,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 13:01:48,523 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:48,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:48,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1374242732, now seen corresponding path program 1 times [2024-11-18 13:01:48,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:48,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896610250] [2024-11-18 13:01:48,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:48,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:48,787 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-18 13:01:48,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:48,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896610250] [2024-11-18 13:01:48,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896610250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:01:48,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:01:48,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 13:01:48,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994257616] [2024-11-18 13:01:48,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:01:48,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 13:01:48,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:48,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 13:01:48,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:01:48,791 INFO L87 Difference]: Start difference. First operand 75 states and 98 transitions. Second operand has 5 states, 5 states have (on average 4.2) 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-18 13:01:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:48,923 INFO L93 Difference]: Finished difference Result 100 states and 130 transitions. [2024-11-18 13:01:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 13:01:48,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) 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-18 13:01:48,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:48,925 INFO L225 Difference]: With dead ends: 100 [2024-11-18 13:01:48,925 INFO L226 Difference]: Without dead ends: 86 [2024-11-18 13:01:48,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:01:48,927 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 15 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:01:48,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 200 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:01:48,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-18 13:01:48,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2024-11-18 13:01:48,940 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-18 13:01:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2024-11-18 13:01:48,941 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 23 [2024-11-18 13:01:48,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:48,941 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2024-11-18 13:01:48,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) 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-18 13:01:48,942 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2024-11-18 13:01:48,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 13:01:48,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:48,943 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-18 13:01:48,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 13:01:48,943 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:48,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:48,944 INFO L85 PathProgramCache]: Analyzing trace with hash -493020186, now seen corresponding path program 1 times [2024-11-18 13:01:48,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:48,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878550568] [2024-11-18 13:01:48,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:48,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:49,507 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-18 13:01:49,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:49,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878550568] [2024-11-18 13:01:49,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878550568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:01:49,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:01:49,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 13:01:49,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027398070] [2024-11-18 13:01:49,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:01:49,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 13:01:49,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:49,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 13:01:49,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-18 13:01:49,510 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 9 states, 8 states have (on average 2.75) 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-18 13:01:49,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:49,794 INFO L93 Difference]: Finished difference Result 107 states and 141 transitions. [2024-11-18 13:01:49,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-18 13:01:49,794 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) 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-18 13:01:49,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:49,795 INFO L225 Difference]: With dead ends: 107 [2024-11-18 13:01:49,796 INFO L226 Difference]: Without dead ends: 105 [2024-11-18 13:01:49,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-18 13:01:49,797 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 25 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:01:49,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 462 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 13:01:49,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-18 13:01:49,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2024-11-18 13:01:49,805 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-18 13:01:49,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2024-11-18 13:01:49,806 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 24 [2024-11-18 13:01:49,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:49,806 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2024-11-18 13:01:49,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) 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-18 13:01:49,806 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2024-11-18 13:01:49,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 13:01:49,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:49,807 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-18 13:01:49,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 13:01:49,808 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:49,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:49,808 INFO L85 PathProgramCache]: Analyzing trace with hash -493018264, now seen corresponding path program 1 times [2024-11-18 13:01:49,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:49,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859687926] [2024-11-18 13:01:49,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:49,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:50,580 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-18 13:01:50,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:50,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859687926] [2024-11-18 13:01:50,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859687926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:01:50,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:01:50,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-18 13:01:50,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950309954] [2024-11-18 13:01:50,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:01:50,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-18 13:01:50,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:50,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-18 13:01:50,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-18 13:01:50,582 INFO L87 Difference]: Start difference. First operand 88 states and 114 transitions. Second operand has 11 states, 10 states have (on average 2.2) 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-18 13:01:50,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:50,938 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2024-11-18 13:01:50,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-18 13:01:50,939 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) 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-18 13:01:50,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:50,940 INFO L225 Difference]: With dead ends: 118 [2024-11-18 13:01:50,940 INFO L226 Difference]: Without dead ends: 106 [2024-11-18 13:01:50,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-18 13:01:50,941 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 24 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:01:50,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 485 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 13:01:50,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-18 13:01:50,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2024-11-18 13:01:50,953 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-18 13:01:50,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 113 transitions. [2024-11-18 13:01:50,953 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 113 transitions. Word has length 24 [2024-11-18 13:01:50,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:50,954 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 113 transitions. [2024-11-18 13:01:50,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) 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-18 13:01:50,954 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 113 transitions. [2024-11-18 13:01:50,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-18 13:01:50,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:50,955 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-18 13:01:50,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 13:01:50,955 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:50,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:50,956 INFO L85 PathProgramCache]: Analyzing trace with hash -854763749, now seen corresponding path program 1 times [2024-11-18 13:01:50,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:50,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000236617] [2024-11-18 13:01:50,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:50,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:51,737 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-18 13:01:51,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:51,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000236617] [2024-11-18 13:01:51,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000236617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:01:51,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671075056] [2024-11-18 13:01:51,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:51,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:01:51,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:01:51,740 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-18 13:01:51,741 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-18 13:01:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:51,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-18 13:01:51,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:01:52,024 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-18 13:01:52,033 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-18 13:01:52,042 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-18 13:01:52,049 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-18 13:01:52,096 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-18 13:01:52,105 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-18 13:01:52,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-18 13:01:52,286 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-18 13:01:52,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:01:52,583 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-18 13:01:52,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671075056] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:01:52,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:01:52,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2024-11-18 13:01:52,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217127146] [2024-11-18 13:01:52,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:01:52,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-18 13:01:52,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:52,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-18 13:01:52,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-18 13:01:52,585 INFO L87 Difference]: Start difference. First operand 88 states and 113 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 13:01:53,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:53,450 INFO L93 Difference]: Finished difference Result 162 states and 209 transitions. [2024-11-18 13:01:53,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-18 13:01:53,451 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 30 [2024-11-18 13:01:53,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:53,452 INFO L225 Difference]: With dead ends: 162 [2024-11-18 13:01:53,452 INFO L226 Difference]: Without dead ends: 138 [2024-11-18 13:01:53,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-11-18 13:01:53,453 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 53 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 13:01:53,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 355 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 13:01:53,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-18 13:01:53,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 128. [2024-11-18 13:01:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 112 states have (on average 1.2767857142857142) internal successors, (143), 113 states have internal predecessors, (143), 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-18 13:01:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 165 transitions. [2024-11-18 13:01:53,473 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 165 transitions. Word has length 30 [2024-11-18 13:01:53,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:53,473 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 165 transitions. [2024-11-18 13:01:53,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-18 13:01:53,474 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 165 transitions. [2024-11-18 13:01:53,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-18 13:01:53,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:53,476 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-18 13:01:53,494 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-18 13:01:53,676 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-18 13:01:53,677 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:53,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:53,677 INFO L85 PathProgramCache]: Analyzing trace with hash 778676608, now seen corresponding path program 1 times [2024-11-18 13:01:53,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:53,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315530691] [2024-11-18 13:01:53,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:53,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:55,724 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-18 13:01:55,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:55,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315530691] [2024-11-18 13:01:55,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315530691] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:01:55,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490775640] [2024-11-18 13:01:55,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:55,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:01:55,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:01:55,728 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-18 13:01:55,729 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-18 13:01:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:55,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-18 13:01:56,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:01:56,014 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-18 13:01:56,186 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-18 13:01:56,217 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-18 13:01:56,220 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-18 13:01:56,231 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 50 treesize of output 43 [2024-11-18 13:01:56,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:01:56,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-18 13:01:56,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 45 treesize of output 11 [2024-11-18 13:01:56,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:01:56,358 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-18 13:01:56,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:01:56,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:01:56,412 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-18 13:01:56,413 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 24 [2024-11-18 13:01:56,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:01:56,428 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-18 13:01:56,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 30 treesize of output 18 [2024-11-18 13:01:56,512 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 5 treesize of output 3 [2024-11-18 13:01:56,517 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-18 13:01:56,631 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-18 13:01:56,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:01:56,638 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-18 13:01:56,647 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-18 13:01:56,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2024-11-18 13:01:56,658 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-18 13:01:56,685 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-18 13:01:56,715 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-18 13:01:56,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:01:56,892 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_append_to_queue_~#p.base_36| Int) (v_ArrVal_1101 Int) (v_ArrVal_1100 (Array Int Int)) (v_ArrVal_1099 (Array Int Int)) (v_ArrVal_1098 (Array Int Int)) (v_append_to_queue_~node~0.base_25 Int)) (or (not (= (select (store |c_#valid| |v_append_to_queue_~#p.base_36| v_ArrVal_1101) v_append_to_queue_~node~0.base_25) 0)) (< |v_append_to_queue_~#p.base_36| (+ |c_#StackHeapBarrier| 1)) (= (mod (select (select (store |c_#memory_int#4| v_append_to_queue_~node~0.base_25 v_ArrVal_1098) (select (select (store |c_#memory_$Pointer$#6.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#6.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base| v_ArrVal_1099) |c_ULTIMATE.start_main_~#prio_queue~0#1.base|) |c_ULTIMATE.start_main_~#prio_queue~0#1.offset|) 4)) 4294967296) 1))) is different from false [2024-11-18 13:01:56,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490775640] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:01:56,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:01:56,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2024-11-18 13:01:56,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497172358] [2024-11-18 13:01:56,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:01:56,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-18 13:01:56,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:01:56,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-18 13:01:56,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=433, Unknown=1, NotChecked=42, Total=552 [2024-11-18 13:01:56,896 INFO L87 Difference]: Start difference. First operand 128 states and 165 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 13:01:59,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:01:59,389 INFO L93 Difference]: Finished difference Result 199 states and 257 transitions. [2024-11-18 13:01:59,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-18 13:01:59,390 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-11-18 13:01:59,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:01:59,391 INFO L225 Difference]: With dead ends: 199 [2024-11-18 13:01:59,391 INFO L226 Difference]: Without dead ends: 172 [2024-11-18 13:01:59,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=199, Invalid=1135, Unknown=2, NotChecked=70, Total=1406 [2024-11-18 13:01:59,392 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 69 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:01:59,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 361 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-18 13:01:59,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-18 13:01:59,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 140. [2024-11-18 13:01:59,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 123 states have (on average 1.2926829268292683) internal successors, (159), 124 states have internal predecessors, (159), 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-18 13:01:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 183 transitions. [2024-11-18 13:01:59,412 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 183 transitions. Word has length 32 [2024-11-18 13:01:59,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:01:59,412 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 183 transitions. [2024-11-18 13:01:59,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 13:01:59,413 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 183 transitions. [2024-11-18 13:01:59,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-18 13:01:59,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:01:59,414 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-18 13:01:59,435 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-18 13:01:59,618 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-18 13:01:59,619 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:01:59,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:01:59,619 INFO L85 PathProgramCache]: Analyzing trace with hash -649880027, now seen corresponding path program 1 times [2024-11-18 13:01:59,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:01:59,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901494601] [2024-11-18 13:01:59,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:59,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:01:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:01:59,948 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-18 13:01:59,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:01:59,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901494601] [2024-11-18 13:01:59,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901494601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:01:59,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795302501] [2024-11-18 13:01:59,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:01:59,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:01:59,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:01:59,951 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-18 13:01:59,952 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-18 13:02:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:02:00,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-18 13:02:00,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:02:00,200 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-18 13:02:04,318 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#6.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (or (exists ((|v_#memory_$Pointer$#6.offset_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#6.offset_BEFORE_CALL_9| |c_#memory_$Pointer$#6.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|)) (= (store |v_#memory_$Pointer$#6.offset_BEFORE_CALL_9| .cse0 (select |c_#memory_$Pointer$#6.offset| .cse0)) |c_#memory_$Pointer$#6.offset|) (= (select (select |v_#memory_$Pointer$#6.offset_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) (= (select (select |c_#memory_$Pointer$#6.offset| |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-18 13:02:04,326 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#6.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (or (exists ((|v_#memory_$Pointer$#6.offset_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#6.offset_BEFORE_CALL_9| |c_#memory_$Pointer$#6.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|)) (= (store |v_#memory_$Pointer$#6.offset_BEFORE_CALL_9| .cse0 (select |c_#memory_$Pointer$#6.offset| .cse0)) |c_#memory_$Pointer$#6.offset|) (= (select (select |v_#memory_$Pointer$#6.offset_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) (= (select (select |c_#memory_$Pointer$#6.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) is different from true [2024-11-18 13:02:04,427 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-18 13:02:04,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:02:04,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795302501] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:02:04,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 13:02:04,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 9 [2024-11-18 13:02:04,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305180001] [2024-11-18 13:02:04,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 13:02:04,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 13:02:04,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:02:04,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 13:02:04,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=48, Unknown=6, NotChecked=14, Total=90 [2024-11-18 13:02:04,543 INFO L87 Difference]: Start difference. First operand 140 states and 183 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 13:02:04,767 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$#6.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (and (= (select (select |c_#memory_$Pointer$#6.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (exists ((|v_#memory_$Pointer$#6.offset_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#6.offset_BEFORE_CALL_9| |c_#memory_$Pointer$#6.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|)) (= (store |v_#memory_$Pointer$#6.offset_BEFORE_CALL_9| .cse0 (select |c_#memory_$Pointer$#6.offset| .cse0)) |c_#memory_$Pointer$#6.offset|) (= (select (select |v_#memory_$Pointer$#6.offset_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) .cse1) .cse1)) is different from false [2024-11-18 13:02:04,769 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$#6.offset| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0))) (and (= (select (select |c_#memory_$Pointer$#6.base| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#normal_queue~0#1.base| |c_ULTIMATE.start_main_~#prio_queue~0#1.base|)) (or (exists ((|v_#memory_$Pointer$#6.offset_BEFORE_CALL_9| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#6.offset_BEFORE_CALL_9| |c_#memory_$Pointer$#6.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~#normal_queue~0#1.base|)) (= (store |v_#memory_$Pointer$#6.offset_BEFORE_CALL_9| .cse0 (select |c_#memory_$Pointer$#6.offset| .cse0)) |c_#memory_$Pointer$#6.offset|) (= (select (select |v_#memory_$Pointer$#6.offset_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#normal_queue~0#1.base|) |c_ULTIMATE.start_main_~#normal_queue~0#1.offset|) 0)))) .cse1) .cse1)) is different from true [2024-11-18 13:02:04,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:02:04,928 INFO L93 Difference]: Finished difference Result 222 states and 287 transitions. [2024-11-18 13:02:04,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 13:02:04,929 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2024-11-18 13:02:04,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:02:04,930 INFO L225 Difference]: With dead ends: 222 [2024-11-18 13:02:04,930 INFO L226 Difference]: Without dead ends: 169 [2024-11-18 13:02:04,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=33, Invalid=76, Unknown=9, NotChecked=38, Total=156 [2024-11-18 13:02:04,931 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 43 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 13:02:04,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 298 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 79 Invalid, 0 Unknown, 126 Unchecked, 0.3s Time] [2024-11-18 13:02:04,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-18 13:02:04,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 149. [2024-11-18 13:02:04,950 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-18 13:02:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 197 transitions. [2024-11-18 13:02:04,951 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 197 transitions. Word has length 33 [2024-11-18 13:02:04,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:02:04,951 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 197 transitions. [2024-11-18 13:02:04,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-18 13:02:04,952 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 197 transitions. [2024-11-18 13:02:04,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-18 13:02:04,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:02:04,953 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-18 13:02:04,973 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-18 13:02:05,157 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-18 13:02:05,158 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:02:05,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:02:05,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1842166586, now seen corresponding path program 1 times [2024-11-18 13:02:05,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:02:05,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645667202] [2024-11-18 13:02:05,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:02:05,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:02:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:02:06,624 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-18 13:02:06,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:02:06,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645667202] [2024-11-18 13:02:06,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645667202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:02:06,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563021001] [2024-11-18 13:02:06,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:02:06,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:02:06,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:02:06,627 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-18 13:02:06,628 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-18 13:02:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:02:07,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 107 conjuncts are in the unsatisfiable core [2024-11-18 13:02:07,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:02:07,076 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-18 13:02:07,124 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-18 13:02:07,543 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-18 13:02:07,550 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-18 13:02:07,564 INFO L349 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2024-11-18 13:02:07,565 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-18 13:02:07,574 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-18 13:02:07,824 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-18 13:02:07,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-18 13:02:08,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-18 13:02:08,099 INFO L349 Elim1Store]: treesize reduction 47, result has 44.0 percent of original size [2024-11-18 13:02:08,099 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 123 treesize of output 138 [2024-11-18 13:02:08,130 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-18 13:02:08,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 15 [2024-11-18 13:02:08,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:02:08,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 35 [2024-11-18 13:02:08,398 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-18 13:02:08,398 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 1 case distinctions, treesize of input 37 treesize of output 15 [2024-11-18 13:02:08,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:02:08,408 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 43 treesize of output 35 [2024-11-18 13:02:08,431 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-18 13:02:08,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 116 [2024-11-18 13:02:12,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-18 13:02:12,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 465 treesize of output 2627