./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.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 ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:11:02,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:11:02,800 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 09:11:02,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:11:02,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:11:02,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:11:02,831 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:11:02,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:11:02,832 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 09:11:02,832 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 09:11:02,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:11:02,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:11:02,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:11:02,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:11:02,834 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:11:02,835 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:11:02,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:11:02,835 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:11:02,836 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:11:02,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:11:02,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:11:02,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:11:02,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:11:02,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:11:02,840 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:11:02,840 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:11:02,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:11:02,840 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:11:02,841 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:11:02,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:11:02,841 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 09:11:02,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:11:02,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:11:02,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:11:02,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:11:02,845 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:11:02,845 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:11:02,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:11:02,845 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:11:02,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:11:02,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:11:02,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:11:02,847 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 -> ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041 [2024-10-13 09:11:03,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:11:03,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:11:03,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:11:03,125 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:11:03,125 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:11:03,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i [2024-10-13 09:11:04,646 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:11:04,957 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:11:04,958 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i [2024-10-13 09:11:04,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a22036fe9/965a7d8686e44a1e84749f59f87fde00/FLAG1a4c1006b [2024-10-13 09:11:05,218 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a22036fe9/965a7d8686e44a1e84749f59f87fde00 [2024-10-13 09:11:05,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:11:05,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:11:05,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:11:05,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:11:05,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:11:05,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:05" (1/1) ... [2024-10-13 09:11:05,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d1ceb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:05, skipping insertion in model container [2024-10-13 09:11:05,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:11:05" (1/1) ... [2024-10-13 09:11:05,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:11:05,736 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i[33021,33034] [2024-10-13 09:11:05,873 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i[44124,44137] [2024-10-13 09:11:05,875 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i[44245,44258] [2024-10-13 09:11:05,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:11:05,909 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:11:05,950 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i[33021,33034] [2024-10-13 09:11:06,000 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i[44124,44137] [2024-10-13 09:11:06,002 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i[44245,44258] [2024-10-13 09:11:06,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:11:06,072 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:11:06,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:06 WrapperNode [2024-10-13 09:11:06,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:11:06,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:11:06,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:11:06,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:11:06,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:06" (1/1) ... [2024-10-13 09:11:06,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:06" (1/1) ... [2024-10-13 09:11:06,203 INFO L138 Inliner]: procedures = 176, calls = 320, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1589 [2024-10-13 09:11:06,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:11:06,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:11:06,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:11:06,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:11:06,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:06" (1/1) ... [2024-10-13 09:11:06,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:06" (1/1) ... [2024-10-13 09:11:06,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:06" (1/1) ... [2024-10-13 09:11:06,342 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [2, 265, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-10-13 09:11:06,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:06" (1/1) ... [2024-10-13 09:11:06,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:06" (1/1) ... [2024-10-13 09:11:06,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:06" (1/1) ... [2024-10-13 09:11:06,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:06" (1/1) ... [2024-10-13 09:11:06,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:06" (1/1) ... [2024-10-13 09:11:06,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:06" (1/1) ... [2024-10-13 09:11:06,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:11:06,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:11:06,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:11:06,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:11:06,481 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:06" (1/1) ... [2024-10-13 09:11:06,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:11:06,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:11:06,580 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-10-13 09:11:06,586 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-10-13 09:11:06,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 09:11:06,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 09:11:06,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 09:11:06,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 09:11:06,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 09:11:06,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 09:11:06,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 09:11:06,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 09:11:06,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 09:11:06,640 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 09:11:06,640 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 09:11:06,640 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 09:11:06,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 09:11:06,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:11:06,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 09:11:06,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 09:11:06,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 09:11:06,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 09:11:06,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 09:11:06,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 09:11:06,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 09:11:06,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 09:11:06,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 09:11:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 09:11:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 09:11:06,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:11:06,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:11:06,916 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:11:06,918 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:11:08,535 INFO L? ?]: Removed 334 outVars from TransFormulas that were not future-live. [2024-10-13 09:11:08,536 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:11:08,603 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:11:08,607 INFO L314 CfgBuilder]: Removed 72 assume(true) statements. [2024-10-13 09:11:08,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:08 BoogieIcfgContainer [2024-10-13 09:11:08,608 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:11:08,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:11:08,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:11:08,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:11:08,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:11:05" (1/3) ... [2024-10-13 09:11:08,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7117a6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:08, skipping insertion in model container [2024-10-13 09:11:08,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:11:06" (2/3) ... [2024-10-13 09:11:08,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7117a6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:11:08, skipping insertion in model container [2024-10-13 09:11:08,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:11:08" (3/3) ... [2024-10-13 09:11:08,619 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test7-2.i [2024-10-13 09:11:08,637 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:11:08,638 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 09:11:08,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:11:08,741 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;@4a6a1a38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:11:08,741 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 09:11:08,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 425 states, 418 states have (on average 1.6339712918660287) internal successors, (683), 420 states have internal predecessors, (683), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 09:11:08,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 09:11:08,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:08,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:11:08,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:08,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:08,763 INFO L85 PathProgramCache]: Analyzing trace with hash 115030448, now seen corresponding path program 1 times [2024-10-13 09:11:08,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:08,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282406637] [2024-10-13 09:11:08,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:08,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:11:08,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:08,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282406637] [2024-10-13 09:11:08,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282406637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:11:08,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:11:08,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:11:08,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744642629] [2024-10-13 09:11:08,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:11:08,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 09:11:08,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:11:08,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 09:11:08,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 09:11:09,000 INFO L87 Difference]: Start difference. First operand has 425 states, 418 states have (on average 1.6339712918660287) internal successors, (683), 420 states have internal predecessors, (683), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:11:09,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:11:09,102 INFO L93 Difference]: Finished difference Result 849 states and 1377 transitions. [2024-10-13 09:11:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 09:11:09,108 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 09:11:09,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:11:09,127 INFO L225 Difference]: With dead ends: 849 [2024-10-13 09:11:09,127 INFO L226 Difference]: Without dead ends: 389 [2024-10-13 09:11:09,133 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-10-13 09:11:09,138 INFO L432 NwaCegarLoop]: 607 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:11:09,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 607 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 09:11:09,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-13 09:11:09,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2024-10-13 09:11:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 383 states have (on average 1.4516971279373367) internal successors, (556), 384 states have internal predecessors, (556), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 09:11:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 562 transitions. [2024-10-13 09:11:09,227 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 562 transitions. Word has length 7 [2024-10-13 09:11:09,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:11:09,229 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 562 transitions. [2024-10-13 09:11:09,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:11:09,230 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 562 transitions. [2024-10-13 09:11:09,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 09:11:09,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:09,230 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:11:09,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:11:09,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:09,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:09,232 INFO L85 PathProgramCache]: Analyzing trace with hash -261640534, now seen corresponding path program 1 times [2024-10-13 09:11:09,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:09,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415568] [2024-10-13 09:11:09,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:09,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:11:09,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:09,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415568] [2024-10-13 09:11:09,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:11:09,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:11:09,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:11:09,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863694472] [2024-10-13 09:11:09,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:11:09,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:11:09,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:11:09,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:11:09,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:11:09,451 INFO L87 Difference]: Start difference. First operand 389 states and 562 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:11:09,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:11:09,658 INFO L93 Difference]: Finished difference Result 963 states and 1394 transitions. [2024-10-13 09:11:09,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:11:09,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-13 09:11:09,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:11:09,667 INFO L225 Difference]: With dead ends: 963 [2024-10-13 09:11:09,667 INFO L226 Difference]: Without dead ends: 773 [2024-10-13 09:11:09,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:11:09,669 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 548 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:11:09,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1619 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:11:09,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2024-10-13 09:11:09,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 391. [2024-10-13 09:11:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 385 states have (on average 1.4493506493506494) internal successors, (558), 386 states have internal predecessors, (558), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 09:11:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 564 transitions. [2024-10-13 09:11:09,713 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 564 transitions. Word has length 9 [2024-10-13 09:11:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:11:09,714 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 564 transitions. [2024-10-13 09:11:09,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:11:09,714 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 564 transitions. [2024-10-13 09:11:09,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 09:11:09,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:09,718 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 09:11:09,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:11:09,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:09,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:09,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1540508619, now seen corresponding path program 1 times [2024-10-13 09:11:09,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:09,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172922681] [2024-10-13 09:11:09,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:09,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:11:10,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:10,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172922681] [2024-10-13 09:11:10,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172922681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:11:10,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:11:10,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 09:11:10,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90027344] [2024-10-13 09:11:10,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:11:10,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:11:10,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:11:10,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:11:10,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:11:10,143 INFO L87 Difference]: Start difference. First operand 391 states and 564 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-10-13 09:11:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:11:10,245 INFO L93 Difference]: Finished difference Result 737 states and 1059 transitions. [2024-10-13 09:11:10,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 09:11:10,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 85 [2024-10-13 09:11:10,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:11:10,249 INFO L225 Difference]: With dead ends: 737 [2024-10-13 09:11:10,249 INFO L226 Difference]: Without dead ends: 349 [2024-10-13 09:11:10,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:11:10,252 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 30 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:11:10,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1357 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:11:10,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-13 09:11:10,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-10-13 09:11:10,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 343 states have (on average 1.402332361516035) internal successors, (481), 344 states have internal predecessors, (481), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 09:11:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 487 transitions. [2024-10-13 09:11:10,269 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 487 transitions. Word has length 85 [2024-10-13 09:11:10,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:11:10,271 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 487 transitions. [2024-10-13 09:11:10,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-10-13 09:11:10,271 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 487 transitions. [2024-10-13 09:11:10,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 09:11:10,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:10,274 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 09:11:10,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:11:10,274 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:10,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:10,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1296227415, now seen corresponding path program 1 times [2024-10-13 09:11:10,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:10,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205545028] [2024-10-13 09:11:10,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:10,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:11:10,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:10,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205545028] [2024-10-13 09:11:10,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205545028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:11:10,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:11:10,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:11:10,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149425804] [2024-10-13 09:11:10,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:11:10,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:11:10,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:11:10,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:11:10,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:11:10,535 INFO L87 Difference]: Start difference. First operand 349 states and 487 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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-10-13 09:11:10,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:11:10,677 INFO L93 Difference]: Finished difference Result 949 states and 1334 transitions. [2024-10-13 09:11:10,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:11:10,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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 85 [2024-10-13 09:11:10,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:11:10,683 INFO L225 Difference]: With dead ends: 949 [2024-10-13 09:11:10,684 INFO L226 Difference]: Without dead ends: 603 [2024-10-13 09:11:10,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:11:10,686 INFO L432 NwaCegarLoop]: 665 mSDtfsCounter, 298 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:11:10,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1119 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:11:10,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-10-13 09:11:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 596. [2024-10-13 09:11:10,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 590 states have (on average 1.4186440677966101) internal successors, (837), 591 states have internal predecessors, (837), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 09:11:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 843 transitions. [2024-10-13 09:11:10,710 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 843 transitions. Word has length 85 [2024-10-13 09:11:10,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:11:10,711 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 843 transitions. [2024-10-13 09:11:10,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 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-10-13 09:11:10,712 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 843 transitions. [2024-10-13 09:11:10,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 09:11:10,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:10,718 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 09:11:10,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:11:10,718 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:10,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:10,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1844066105, now seen corresponding path program 1 times [2024-10-13 09:11:10,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:10,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21846510] [2024-10-13 09:11:10,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:10,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:11,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 09:11:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:11,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:11:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:11,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 09:11:11,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:11,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21846510] [2024-10-13 09:11:11,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21846510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:11:11,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:11:11,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:11:11,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052410189] [2024-10-13 09:11:11,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:11:11,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 09:11:11,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:11:11,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 09:11:11,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:11:11,226 INFO L87 Difference]: Start difference. First operand 596 states and 843 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:11:11,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:11:11,627 INFO L93 Difference]: Finished difference Result 880 states and 1249 transitions. [2024-10-13 09:11:11,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 09:11:11,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 98 [2024-10-13 09:11:11,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:11:11,637 INFO L225 Difference]: With dead ends: 880 [2024-10-13 09:11:11,637 INFO L226 Difference]: Without dead ends: 876 [2024-10-13 09:11:11,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:11:11,639 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 460 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 09:11:11,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1865 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 09:11:11,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-10-13 09:11:11,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 598. [2024-10-13 09:11:11,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 592 states have (on average 1.4172297297297298) internal successors, (839), 593 states have internal predecessors, (839), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 09:11:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 845 transitions. [2024-10-13 09:11:11,661 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 845 transitions. Word has length 98 [2024-10-13 09:11:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:11:11,662 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 845 transitions. [2024-10-13 09:11:11,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:11:11,663 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 845 transitions. [2024-10-13 09:11:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 09:11:11,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:11,669 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 09:11:11,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:11:11,670 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:11,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:11,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1127883768, now seen corresponding path program 1 times [2024-10-13 09:11:11,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:11,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576695872] [2024-10-13 09:11:11,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:11,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:12,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 09:11:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:12,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:11:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 09:11:12,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:12,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576695872] [2024-10-13 09:11:12,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576695872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:11:12,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:11:12,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:11:12,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655954034] [2024-10-13 09:11:12,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:11:12,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 09:11:12,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:11:12,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 09:11:12,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:11:12,049 INFO L87 Difference]: Start difference. First operand 598 states and 845 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:11:12,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:11:12,360 INFO L93 Difference]: Finished difference Result 865 states and 1230 transitions. [2024-10-13 09:11:12,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:11:12,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2024-10-13 09:11:12,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:11:12,364 INFO L225 Difference]: With dead ends: 865 [2024-10-13 09:11:12,364 INFO L226 Difference]: Without dead ends: 516 [2024-10-13 09:11:12,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:11:12,366 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 32 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:11:12,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1408 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 09:11:12,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-10-13 09:11:12,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 514. [2024-10-13 09:11:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 508 states have (on average 1.3484251968503937) internal successors, (685), 509 states have internal predecessors, (685), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 09:11:12,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 691 transitions. [2024-10-13 09:11:12,382 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 691 transitions. Word has length 152 [2024-10-13 09:11:12,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:11:12,383 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 691 transitions. [2024-10-13 09:11:12,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:11:12,384 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 691 transitions. [2024-10-13 09:11:12,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 09:11:12,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:12,388 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 09:11:12,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:11:12,388 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:12,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:12,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1995569404, now seen corresponding path program 1 times [2024-10-13 09:11:12,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:12,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618381950] [2024-10-13 09:11:12,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:12,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:12,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 09:11:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:12,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:11:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:12,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:11:12,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:12,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618381950] [2024-10-13 09:11:12,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618381950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:11:12,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:11:12,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:11:12,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665909936] [2024-10-13 09:11:12,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:11:12,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:11:12,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:11:12,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:11:12,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:11:12,722 INFO L87 Difference]: Start difference. First operand 514 states and 691 transitions. Second operand has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:11:13,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:11:13,425 INFO L93 Difference]: Finished difference Result 1287 states and 1734 transitions. [2024-10-13 09:11:13,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:11:13,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2024-10-13 09:11:13,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:11:13,431 INFO L225 Difference]: With dead ends: 1287 [2024-10-13 09:11:13,431 INFO L226 Difference]: Without dead ends: 863 [2024-10-13 09:11:13,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:11:13,433 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 1343 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1345 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 09:11:13,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1345 Valid, 1522 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 09:11:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-10-13 09:11:13,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 653. [2024-10-13 09:11:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 647 states have (on average 1.3508500772797527) internal successors, (874), 648 states have internal predecessors, (874), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 09:11:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 880 transitions. [2024-10-13 09:11:13,455 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 880 transitions. Word has length 152 [2024-10-13 09:11:13,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:11:13,456 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 880 transitions. [2024-10-13 09:11:13,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.333333333333332) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:11:13,457 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 880 transitions. [2024-10-13 09:11:13,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 09:11:13,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:13,458 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 09:11:13,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:11:13,459 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:13,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:13,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1205085264, now seen corresponding path program 1 times [2024-10-13 09:11:13,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:13,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153424198] [2024-10-13 09:11:13,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:13,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:14,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 09:11:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:14,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:11:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:11:14,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:14,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153424198] [2024-10-13 09:11:14,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153424198] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:11:14,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672613276] [2024-10-13 09:11:14,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:14,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:11:14,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:11:14,466 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-10-13 09:11:14,467 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-10-13 09:11:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:14,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 09:11:14,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:11:14,896 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-10-13 09:11:15,115 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 36 treesize of output 13 [2024-10-13 09:11:15,128 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 7 [2024-10-13 09:11:15,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:11:15,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:11:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:11:15,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672613276] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:11:15,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:11:15,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2024-10-13 09:11:15,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029172890] [2024-10-13 09:11:15,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:11:15,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 09:11:15,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:11:15,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 09:11:15,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-13 09:11:15,323 INFO L87 Difference]: Start difference. First operand 653 states and 880 transitions. Second operand has 12 states, 12 states have (on average 20.5) internal successors, (246), 11 states have internal predecessors, (246), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 09:11:15,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:11:15,921 INFO L93 Difference]: Finished difference Result 2930 states and 3963 transitions. [2024-10-13 09:11:15,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 09:11:15,923 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.5) internal successors, (246), 11 states have internal predecessors, (246), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 162 [2024-10-13 09:11:15,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:11:15,933 INFO L225 Difference]: With dead ends: 2930 [2024-10-13 09:11:15,933 INFO L226 Difference]: Without dead ends: 2523 [2024-10-13 09:11:15,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-13 09:11:15,936 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 2243 mSDsluCounter, 2631 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2255 SdHoareTripleChecker+Valid, 3053 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 09:11:15,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2255 Valid, 3053 Invalid, 217 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [16 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 09:11:15,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2024-10-13 09:11:15,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 999. [2024-10-13 09:11:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 989 states have (on average 1.3447927199191103) internal successors, (1330), 990 states have internal predecessors, (1330), 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-10-13 09:11:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1342 transitions. [2024-10-13 09:11:15,986 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1342 transitions. Word has length 162 [2024-10-13 09:11:15,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:11:15,986 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1342 transitions. [2024-10-13 09:11:15,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.5) internal successors, (246), 11 states have internal predecessors, (246), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 09:11:15,987 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1342 transitions. [2024-10-13 09:11:15,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-10-13 09:11:15,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:15,995 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 09:11:16,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 09:11:16,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:11:16,200 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:16,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:16,201 INFO L85 PathProgramCache]: Analyzing trace with hash 332570551, now seen corresponding path program 1 times [2024-10-13 09:11:16,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:16,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383467391] [2024-10-13 09:11:16,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:16,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:20,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 09:11:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:20,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:11:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:11:20,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:20,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383467391] [2024-10-13 09:11:20,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383467391] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:11:20,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822690091] [2024-10-13 09:11:20,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:20,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:11:20,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:11:20,079 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-10-13 09:11:20,081 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-10-13 09:11:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:20,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 1896 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 09:11:20,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:11:20,847 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-10-13 09:11:21,056 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 36 treesize of output 13 [2024-10-13 09:11:21,181 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 36 treesize of output 13 [2024-10-13 09:11:21,299 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 36 treesize of output 13 [2024-10-13 09:11:21,412 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 36 treesize of output 13 [2024-10-13 09:11:21,420 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 7 [2024-10-13 09:11:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:11:21,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:11:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:11:21,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822690091] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:11:21,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:11:21,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 20 [2024-10-13 09:11:21,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675848460] [2024-10-13 09:11:21,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:11:21,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-13 09:11:21,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:11:21,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-13 09:11:21,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2024-10-13 09:11:21,980 INFO L87 Difference]: Start difference. First operand 999 states and 1342 transitions. Second operand has 20 states, 20 states have (on average 35.3) internal successors, (706), 19 states have internal predecessors, (706), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 09:11:23,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:11:23,156 INFO L93 Difference]: Finished difference Result 6218 states and 8418 transitions. [2024-10-13 09:11:23,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 09:11:23,157 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 35.3) internal successors, (706), 19 states have internal predecessors, (706), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 390 [2024-10-13 09:11:23,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:11:23,182 INFO L225 Difference]: With dead ends: 6218 [2024-10-13 09:11:23,183 INFO L226 Difference]: Without dead ends: 5811 [2024-10-13 09:11:23,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 802 GetRequests, 773 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2024-10-13 09:11:23,190 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 6248 mSDsluCounter, 5408 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6272 SdHoareTripleChecker+Valid, 5830 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 09:11:23,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6272 Valid, 5830 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 09:11:23,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5811 states. [2024-10-13 09:11:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5811 to 1863. [2024-10-13 09:11:23,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1863 states, 1847 states have (on average 1.3405522468868436) internal successors, (2476), 1848 states have internal predecessors, (2476), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:11:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1863 states and 2500 transitions. [2024-10-13 09:11:23,288 INFO L78 Accepts]: Start accepts. Automaton has 1863 states and 2500 transitions. Word has length 390 [2024-10-13 09:11:23,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:11:23,289 INFO L471 AbstractCegarLoop]: Abstraction has 1863 states and 2500 transitions. [2024-10-13 09:11:23,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 35.3) internal successors, (706), 19 states have internal predecessors, (706), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 09:11:23,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 2500 transitions. [2024-10-13 09:11:23,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2024-10-13 09:11:23,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:23,307 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 09:11:23,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 09:11:23,508 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,SelfDestructingSolverStorable8 [2024-10-13 09:11:23,509 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:23,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:23,509 INFO L85 PathProgramCache]: Analyzing trace with hash -157890235, now seen corresponding path program 2 times [2024-10-13 09:11:23,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:23,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851000478] [2024-10-13 09:11:23,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:23,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:35,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 09:11:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:35,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:11:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:11:35,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:35,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851000478] [2024-10-13 09:11:35,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851000478] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:11:35,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271210129] [2024-10-13 09:11:35,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 09:11:35,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:11:35,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:11:35,156 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-10-13 09:11:35,164 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-10-13 09:11:35,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 09:11:35,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 09:11:35,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 09:11:35,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:11:35,960 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-10-13 09:11:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3425 trivial. 0 not checked. [2024-10-13 09:11:36,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 09:11:36,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271210129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:11:36,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 09:11:36,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [20] total 27 [2024-10-13 09:11:36,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261888081] [2024-10-13 09:11:36,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:11:36,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 09:11:36,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:11:36,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 09:11:36,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2024-10-13 09:11:36,705 INFO L87 Difference]: Start difference. First operand 1863 states and 2500 transitions. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:11:37,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:11:37,522 INFO L93 Difference]: Finished difference Result 2447 states and 3283 transitions. [2024-10-13 09:11:37,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:11:37,523 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 846 [2024-10-13 09:11:37,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:11:37,535 INFO L225 Difference]: With dead ends: 2447 [2024-10-13 09:11:37,535 INFO L226 Difference]: Without dead ends: 2043 [2024-10-13 09:11:37,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 844 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2024-10-13 09:11:37,538 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 395 mSDsluCounter, 1819 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:11:37,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 2255 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 09:11:37,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2024-10-13 09:11:37,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 1898. [2024-10-13 09:11:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1882 states have (on average 1.3363443145589797) internal successors, (2515), 1883 states have internal predecessors, (2515), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 09:11:37,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2539 transitions. [2024-10-13 09:11:37,617 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2539 transitions. Word has length 846 [2024-10-13 09:11:37,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:11:37,618 INFO L471 AbstractCegarLoop]: Abstraction has 1898 states and 2539 transitions. [2024-10-13 09:11:37,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 09:11:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2539 transitions. [2024-10-13 09:11:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2024-10-13 09:11:37,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:37,641 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 09:11:37,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 09:11:37,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:11:37,846 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:37,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:37,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1706688756, now seen corresponding path program 1 times [2024-10-13 09:11:37,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:37,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006931137] [2024-10-13 09:11:37,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:37,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:48,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 09:11:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:48,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 09:11:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:48,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:11:48,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:11:48,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006931137] [2024-10-13 09:11:48,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006931137] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:11:48,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673694946] [2024-10-13 09:11:48,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:48,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:11:48,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:11:48,420 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-10-13 09:11:48,421 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-10-13 09:11:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:11:49,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 4159 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-13 09:11:49,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:11:49,950 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-10-13 09:11:50,144 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 36 treesize of output 13 [2024-10-13 09:11:50,253 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 36 treesize of output 13 [2024-10-13 09:11:50,348 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 36 treesize of output 13 [2024-10-13 09:11:50,463 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 36 treesize of output 13 [2024-10-13 09:11:50,550 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 36 treesize of output 13 [2024-10-13 09:11:50,637 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 36 treesize of output 13 [2024-10-13 09:11:50,731 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 36 treesize of output 13 [2024-10-13 09:11:50,833 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 36 treesize of output 13 [2024-10-13 09:11:50,923 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 36 treesize of output 13 [2024-10-13 09:11:51,028 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 36 treesize of output 13 [2024-10-13 09:11:51,032 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 7 [2024-10-13 09:11:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:11:51,038 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:11:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3425 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 09:11:52,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673694946] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:11:52,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:11:52,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 33 [2024-10-13 09:11:52,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920749903] [2024-10-13 09:11:52,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:11:52,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-13 09:11:52,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:11:52,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-13 09:11:52,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=643, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 09:11:52,161 INFO L87 Difference]: Start difference. First operand 1898 states and 2539 transitions. Second operand has 33 states, 33 states have (on average 49.121212121212125) internal successors, (1621), 32 states have internal predecessors, (1621), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 09:11:54,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:11:54,573 INFO L93 Difference]: Finished difference Result 12829 states and 17366 transitions. [2024-10-13 09:11:54,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-13 09:11:54,575 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 49.121212121212125) internal successors, (1621), 32 states have internal predecessors, (1621), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 847 [2024-10-13 09:11:54,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:11:54,633 INFO L225 Difference]: With dead ends: 12829 [2024-10-13 09:11:54,634 INFO L226 Difference]: Without dead ends: 12387 [2024-10-13 09:11:54,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1736 GetRequests, 1683 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=878, Invalid=1774, Unknown=0, NotChecked=0, Total=2652 [2024-10-13 09:11:54,648 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 15448 mSDsluCounter, 10418 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15496 SdHoareTripleChecker+Valid, 10840 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 09:11:54,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15496 Valid, 10840 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 09:11:54,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12387 states. [2024-10-13 09:11:54,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12387 to 3626. [2024-10-13 09:11:54,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3626 states, 3598 states have (on average 1.3360200111172873) internal successors, (4807), 3599 states have internal predecessors, (4807), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 09:11:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 3626 states and 4855 transitions. [2024-10-13 09:11:54,886 INFO L78 Accepts]: Start accepts. Automaton has 3626 states and 4855 transitions. Word has length 847 [2024-10-13 09:11:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:11:54,887 INFO L471 AbstractCegarLoop]: Abstraction has 3626 states and 4855 transitions. [2024-10-13 09:11:54,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 49.121212121212125) internal successors, (1621), 32 states have internal predecessors, (1621), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 09:11:54,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3626 states and 4855 transitions. [2024-10-13 09:11:54,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1760 [2024-10-13 09:11:54,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:11:54,912 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 09:11:54,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 09:11:55,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:11:55,113 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:11:55,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:11:55,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1703065232, now seen corresponding path program 2 times [2024-10-13 09:11:55,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:11:55,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906286658] [2024-10-13 09:11:55,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:11:55,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:11:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat