./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-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 e095bb5ea0d924a9f9ab04ab393eec77de9b1aa4e50357711d33ebab16e651dd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 11:56:54,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 11:56:55,054 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 11:56:55,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 11:56:55,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 11:56:55,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 11:56:55,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 11:56:55,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 11:56:55,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 11:56:55,108 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 11:56:55,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 11:56:55,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 11:56:55,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 11:56:55,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 11:56:55,112 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 11:56:55,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 11:56:55,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 11:56:55,113 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 11:56:55,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 11:56:55,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 11:56:55,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 11:56:55,118 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 11:56:55,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 11:56:55,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 11:56:55,119 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 11:56:55,119 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 11:56:55,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 11:56:55,120 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 11:56:55,120 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 11:56:55,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 11:56:55,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 11:56:55,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 11:56:55,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 11:56:55,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 11:56:55,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 11:56:55,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 11:56:55,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 11:56:55,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 11:56:55,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 11:56:55,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 11:56:55,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 11:56:55,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 11:56:55,129 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 -> e095bb5ea0d924a9f9ab04ab393eec77de9b1aa4e50357711d33ebab16e651dd [2024-11-12 11:56:55,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 11:56:55,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 11:56:55,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 11:56:55,425 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 11:56:55,426 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 11:56:55,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-2.i [2024-11-12 11:56:56,890 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 11:56:57,227 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 11:56:57,227 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-2.i [2024-11-12 11:56:57,255 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d06d073/b0c5bfd9278e4650b620faa9bcd442ce/FLAG23e2f42fe [2024-11-12 11:56:57,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d06d073/b0c5bfd9278e4650b620faa9bcd442ce [2024-11-12 11:56:57,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 11:56:57,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 11:56:57,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 11:56:57,282 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 11:56:57,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 11:56:57,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:56:57" (1/1) ... [2024-11-12 11:56:57,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2356df57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:56:57, skipping insertion in model container [2024-11-12 11:56:57,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 11:56:57" (1/1) ... [2024-11-12 11:56:57,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 11:56:57,751 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-2.i[33021,33034] [2024-11-12 11:56:57,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 11:56:57,895 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 11:56:57,930 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-2.i[33021,33034] [2024-11-12 11:56:58,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 11:56:58,065 INFO L204 MainTranslator]: Completed translation [2024-11-12 11:56:58,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:56:58 WrapperNode [2024-11-12 11:56:58,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 11:56:58,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 11:56:58,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 11:56:58,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 11:56:58,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:56:58" (1/1) ... [2024-11-12 11:56:58,112 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:56:58" (1/1) ... [2024-11-12 11:56:58,190 INFO L138 Inliner]: procedures = 176, calls = 386, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1752 [2024-11-12 11:56:58,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 11:56:58,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 11:56:58,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 11:56:58,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 11:56:58,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:56:58" (1/1) ... [2024-11-12 11:56:58,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:56:58" (1/1) ... [2024-11-12 11:56:58,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:56:58" (1/1) ... [2024-11-12 11:56:58,453 INFO L175 MemorySlicer]: Split 357 memory accesses to 2 slices as follows [2, 355]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 90 writes are split as follows [0, 90]. [2024-11-12 11:56:58,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:56:58" (1/1) ... [2024-11-12 11:56:58,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:56:58" (1/1) ... [2024-11-12 11:56:58,517 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:56:58" (1/1) ... [2024-11-12 11:56:58,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:56:58" (1/1) ... [2024-11-12 11:56:58,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:56:58" (1/1) ... [2024-11-12 11:56:58,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:56:58" (1/1) ... [2024-11-12 11:56:58,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 11:56:58,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 11:56:58,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 11:56:58,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 11:56:58,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:56:58" (1/1) ... [2024-11-12 11:56:58,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 11:56:58,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 11:56:58,624 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 11:56:58,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 11:56:58,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 11:56:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 11:56:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 11:56:58,683 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 11:56:58,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 11:56:58,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 11:56:58,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 11:56:58,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 11:56:58,684 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 11:56:58,684 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 11:56:58,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 11:56:58,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 11:56:58,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 11:56:58,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 11:56:58,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 11:56:58,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 11:56:58,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 11:56:58,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 11:56:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 11:56:58,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 11:56:58,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 11:56:58,969 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 11:56:58,971 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 11:57:00,920 INFO L? ?]: Removed 414 outVars from TransFormulas that were not future-live. [2024-11-12 11:57:00,920 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 11:57:00,951 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 11:57:00,955 INFO L316 CfgBuilder]: Removed 69 assume(true) statements. [2024-11-12 11:57:00,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:57:00 BoogieIcfgContainer [2024-11-12 11:57:00,956 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 11:57:00,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 11:57:00,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 11:57:00,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 11:57:00,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 11:56:57" (1/3) ... [2024-11-12 11:57:00,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbd0f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:57:00, skipping insertion in model container [2024-11-12 11:57:00,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 11:56:58" (2/3) ... [2024-11-12 11:57:00,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbd0f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 11:57:00, skipping insertion in model container [2024-11-12 11:57:00,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 11:57:00" (3/3) ... [2024-11-12 11:57:00,968 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test4-2.i [2024-11-12 11:57:00,987 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 11:57:00,987 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 11:57:01,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 11:57:01,090 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;@66466aad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 11:57:01,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 11:57:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 460 states, 440 states have (on average 1.6181818181818182) internal successors, (712), 451 states have internal predecessors, (712), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 11:57:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 11:57:01,106 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:57:01,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:57:01,108 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 11:57:01,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:57:01,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1160532636, now seen corresponding path program 1 times [2024-11-12 11:57:01,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:57:01,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976181923] [2024-11-12 11:57:01,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:57:01,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:57:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:57:01,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:57:01,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976181923] [2024-11-12 11:57:01,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976181923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:57:01,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:57:01,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 11:57:01,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657302030] [2024-11-12 11:57:01,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:57:01,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 11:57:01,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:57:01,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 11:57:01,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 11:57:01,416 INFO L87 Difference]: Start difference. First operand has 460 states, 440 states have (on average 1.6181818181818182) internal successors, (712), 451 states have internal predecessors, (712), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:57:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:57:01,575 INFO L93 Difference]: Finished difference Result 1302 states and 2121 transitions. [2024-11-12 11:57:01,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 11:57:01,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-12 11:57:01,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:57:01,603 INFO L225 Difference]: With dead ends: 1302 [2024-11-12 11:57:01,603 INFO L226 Difference]: Without dead ends: 805 [2024-11-12 11:57:01,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 11:57:01,619 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 545 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 11:57:01,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1411 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 11:57:01,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-12 11:57:01,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 422. [2024-11-12 11:57:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 403 states have (on average 1.4491315136476426) internal successors, (584), 413 states have internal predecessors, (584), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 11:57:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 616 transitions. [2024-11-12 11:57:01,699 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 616 transitions. Word has length 10 [2024-11-12 11:57:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:57:01,699 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 616 transitions. [2024-11-12 11:57:01,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:57:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 616 transitions. [2024-11-12 11:57:01,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-12 11:57:01,708 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:57:01,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:57:01,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 11:57:01,709 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 11:57:01,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:57:01,711 INFO L85 PathProgramCache]: Analyzing trace with hash 478627325, now seen corresponding path program 1 times [2024-11-12 11:57:01,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:57:01,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137339360] [2024-11-12 11:57:01,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:57:01,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:57:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:57:02,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:57:02,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137339360] [2024-11-12 11:57:02,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137339360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:57:02,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:57:02,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 11:57:02,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623082624] [2024-11-12 11:57:02,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:57:02,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 11:57:02,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:57:02,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 11:57:02,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 11:57:02,457 INFO L87 Difference]: Start difference. First operand 422 states and 616 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:57:02,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:57:02,609 INFO L93 Difference]: Finished difference Result 844 states and 1232 transitions. [2024-11-12 11:57:02,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 11:57:02,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2024-11-12 11:57:02,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:57:02,613 INFO L225 Difference]: With dead ends: 844 [2024-11-12 11:57:02,614 INFO L226 Difference]: Without dead ends: 425 [2024-11-12 11:57:02,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 11:57:02,619 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 105 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 11:57:02,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1668 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 11:57:02,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-12 11:57:02,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2024-11-12 11:57:02,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 403 states have (on average 1.4317617866004964) internal successors, (577), 413 states have internal predecessors, (577), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 11:57:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 609 transitions. [2024-11-12 11:57:02,649 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 609 transitions. Word has length 156 [2024-11-12 11:57:02,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:57:02,653 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 609 transitions. [2024-11-12 11:57:02,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:57:02,653 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 609 transitions. [2024-11-12 11:57:02,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-12 11:57:02,663 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:57:02,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:57:02,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 11:57:02,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 11:57:02,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:57:02,667 INFO L85 PathProgramCache]: Analyzing trace with hash -94439567, now seen corresponding path program 1 times [2024-11-12 11:57:02,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:57:02,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659469295] [2024-11-12 11:57:02,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:57:02,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:57:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 11:57:02,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:57:02,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659469295] [2024-11-12 11:57:02,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659469295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:57:02,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:57:02,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 11:57:02,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990097379] [2024-11-12 11:57:02,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:57:02,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 11:57:02,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:57:02,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 11:57:02,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 11:57:02,993 INFO L87 Difference]: Start difference. First operand 422 states and 609 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:57:03,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:57:03,062 INFO L93 Difference]: Finished difference Result 970 states and 1404 transitions. [2024-11-12 11:57:03,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 11:57:03,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2024-11-12 11:57:03,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:57:03,070 INFO L225 Difference]: With dead ends: 970 [2024-11-12 11:57:03,070 INFO L226 Difference]: Without dead ends: 551 [2024-11-12 11:57:03,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 11:57:03,075 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 134 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 11:57:03,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1207 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 11:57:03,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-12 11:57:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2024-11-12 11:57:03,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 532 states have (on average 1.4379699248120301) internal successors, (765), 542 states have internal predecessors, (765), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 11:57:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 797 transitions. [2024-11-12 11:57:03,109 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 797 transitions. Word has length 156 [2024-11-12 11:57:03,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:57:03,111 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 797 transitions. [2024-11-12 11:57:03,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 11:57:03,111 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 797 transitions. [2024-11-12 11:57:03,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-12 11:57:03,115 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:57:03,115 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:57:03,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 11:57:03,116 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 11:57:03,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:57:03,117 INFO L85 PathProgramCache]: Analyzing trace with hash 957115648, now seen corresponding path program 1 times [2024-11-12 11:57:03,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:57:03,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409465578] [2024-11-12 11:57:03,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:57:03,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:57:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:03,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 11:57:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:03,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 11:57:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 11:57:03,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:57:03,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409465578] [2024-11-12 11:57:03,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409465578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:57:03,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:57:03,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 11:57:03,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247880955] [2024-11-12 11:57:03,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:57:03,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 11:57:03,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:57:03,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 11:57:03,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 11:57:03,610 INFO L87 Difference]: Start difference. First operand 551 states and 797 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 11:57:04,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:57:04,129 INFO L93 Difference]: Finished difference Result 931 states and 1346 transitions. [2024-11-12 11:57:04,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 11:57:04,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2024-11-12 11:57:04,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:57:04,136 INFO L225 Difference]: With dead ends: 931 [2024-11-12 11:57:04,137 INFO L226 Difference]: Without dead ends: 512 [2024-11-12 11:57:04,138 INFO L434 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-11-12 11:57:04,139 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 44 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 11:57:04,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 1843 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 11:57:04,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-11-12 11:57:04,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 509. [2024-11-12 11:57:04,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 490 states have (on average 1.4040816326530612) internal successors, (688), 500 states have internal predecessors, (688), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 11:57:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 720 transitions. [2024-11-12 11:57:04,169 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 720 transitions. Word has length 171 [2024-11-12 11:57:04,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:57:04,172 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 720 transitions. [2024-11-12 11:57:04,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 11:57:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 720 transitions. [2024-11-12 11:57:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-12 11:57:04,176 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:57:04,176 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:57:04,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 11:57:04,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 11:57:04,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:57:04,177 INFO L85 PathProgramCache]: Analyzing trace with hash -791127020, now seen corresponding path program 1 times [2024-11-12 11:57:04,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:57:04,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859132543] [2024-11-12 11:57:04,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:57:04,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:57:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:04,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 11:57:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:04,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 11:57:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:04,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 11:57:04,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:57:04,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859132543] [2024-11-12 11:57:04,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859132543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:57:04,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:57:04,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 11:57:04,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878533456] [2024-11-12 11:57:04,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:57:04,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 11:57:04,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:57:04,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 11:57:04,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 11:57:04,503 INFO L87 Difference]: Start difference. First operand 509 states and 720 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 11:57:05,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:57:05,024 INFO L93 Difference]: Finished difference Result 883 states and 1252 transitions. [2024-11-12 11:57:05,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 11:57:05,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2024-11-12 11:57:05,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:57:05,028 INFO L225 Difference]: With dead ends: 883 [2024-11-12 11:57:05,029 INFO L226 Difference]: Without dead ends: 506 [2024-11-12 11:57:05,030 INFO L434 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-11-12 11:57:05,030 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 17 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 11:57:05,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1850 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 11:57:05,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-12 11:57:05,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 503. [2024-11-12 11:57:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 484 states have (on average 1.4008264462809918) internal successors, (678), 494 states have internal predecessors, (678), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 11:57:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 710 transitions. [2024-11-12 11:57:05,052 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 710 transitions. Word has length 171 [2024-11-12 11:57:05,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:57:05,052 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 710 transitions. [2024-11-12 11:57:05,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 11:57:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 710 transitions. [2024-11-12 11:57:05,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-12 11:57:05,055 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:57:05,055 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:57:05,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 11:57:05,058 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 11:57:05,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:57:05,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1666136820, now seen corresponding path program 1 times [2024-11-12 11:57:05,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:57:05,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623054485] [2024-11-12 11:57:05,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:57:05,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:57:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:05,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 11:57:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:05,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 11:57:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:05,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 11:57:05,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:57:05,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623054485] [2024-11-12 11:57:05,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623054485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 11:57:05,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 11:57:05,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 11:57:05,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310279724] [2024-11-12 11:57:05,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 11:57:05,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 11:57:05,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:57:05,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 11:57:05,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 11:57:05,386 INFO L87 Difference]: Start difference. First operand 503 states and 710 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 11:57:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:57:05,914 INFO L93 Difference]: Finished difference Result 1017 states and 1429 transitions. [2024-11-12 11:57:05,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 11:57:05,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2024-11-12 11:57:05,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:57:05,921 INFO L225 Difference]: With dead ends: 1017 [2024-11-12 11:57:05,922 INFO L226 Difference]: Without dead ends: 646 [2024-11-12 11:57:05,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 11:57:05,924 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 247 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 11:57:05,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1414 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 11:57:05,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-12 11:57:05,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 643. [2024-11-12 11:57:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 621 states have (on average 1.3832528180354267) internal successors, (859), 631 states have internal predecessors, (859), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 11:57:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 897 transitions. [2024-11-12 11:57:05,948 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 897 transitions. Word has length 171 [2024-11-12 11:57:05,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:57:05,949 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 897 transitions. [2024-11-12 11:57:05,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 11:57:05,950 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 897 transitions. [2024-11-12 11:57:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-12 11:57:05,951 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:57:05,952 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:57:05,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 11:57:05,952 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 11:57:05,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:57:05,953 INFO L85 PathProgramCache]: Analyzing trace with hash -426146729, now seen corresponding path program 1 times [2024-11-12 11:57:05,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:57:05,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993606900] [2024-11-12 11:57:05,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:57:05,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:57:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:06,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 11:57:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:06,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 11:57:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:06,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 11:57:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:06,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 11:57:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 11:57:06,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:57:06,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993606900] [2024-11-12 11:57:06,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993606900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 11:57:06,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104127673] [2024-11-12 11:57:06,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:57:06,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 11:57:06,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 11:57:06,391 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 11:57:06,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 11:57:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:06,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 11:57:06,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 11:57:07,169 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 11:57:07,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 11:57:07,465 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 11:57:07,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104127673] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 11:57:07,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 11:57:07,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-12 11:57:07,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571021477] [2024-11-12 11:57:07,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 11:57:07,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 11:57:07,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:57:07,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 11:57:07,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-12 11:57:07,471 INFO L87 Difference]: Start difference. First operand 643 states and 897 transitions. Second operand has 8 states, 8 states have (on average 60.5) internal successors, (484), 7 states have internal predecessors, (484), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 11:57:08,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:57:08,862 INFO L93 Difference]: Finished difference Result 1412 states and 1988 transitions. [2024-11-12 11:57:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 11:57:08,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 60.5) internal successors, (484), 7 states have internal predecessors, (484), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 186 [2024-11-12 11:57:08,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:57:08,869 INFO L225 Difference]: With dead ends: 1412 [2024-11-12 11:57:08,870 INFO L226 Difference]: Without dead ends: 1381 [2024-11-12 11:57:08,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-12 11:57:08,872 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 1786 mSDsluCounter, 2070 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1818 SdHoareTripleChecker+Valid, 2582 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 11:57:08,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1818 Valid, 2582 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 11:57:08,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2024-11-12 11:57:08,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1378. [2024-11-12 11:57:08,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1341 states have (on average 1.372110365398956) internal successors, (1840), 1351 states have internal predecessors, (1840), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 25 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 11:57:08,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1908 transitions. [2024-11-12 11:57:08,911 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1908 transitions. Word has length 186 [2024-11-12 11:57:08,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:57:08,912 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1908 transitions. [2024-11-12 11:57:08,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 60.5) internal successors, (484), 7 states have internal predecessors, (484), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 11:57:08,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1908 transitions. [2024-11-12 11:57:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2024-11-12 11:57:08,924 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:57:08,924 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:57:08,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 11:57:09,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 11:57:09,126 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 11:57:09,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:57:09,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1048819294, now seen corresponding path program 1 times [2024-11-12 11:57:09,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:57:09,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976919370] [2024-11-12 11:57:09,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:57:09,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 11:57:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:10,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 11:57:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:10,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 11:57:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:10,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 11:57:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:10,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 11:57:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:10,905 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 11:57:10,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 11:57:10,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976919370] [2024-11-12 11:57:10,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976919370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 11:57:10,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707262542] [2024-11-12 11:57:10,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:57:10,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 11:57:10,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 11:57:10,910 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 11:57:10,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 11:57:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 11:57:12,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 3112 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 11:57:12,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 11:57:12,790 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 11:57:12,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 11:57:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 11:57:13,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707262542] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 11:57:13,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 11:57:13,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2024-11-12 11:57:13,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591174016] [2024-11-12 11:57:13,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 11:57:13,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 11:57:13,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 11:57:13,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 11:57:13,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2024-11-12 11:57:13,643 INFO L87 Difference]: Start difference. First operand 1378 states and 1908 transitions. Second operand has 14 states, 14 states have (on average 97.14285714285714) internal successors, (1360), 13 states have internal predecessors, (1360), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 11:57:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 11:57:14,558 INFO L93 Difference]: Finished difference Result 3428 states and 4811 transitions. [2024-11-12 11:57:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 11:57:14,559 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 97.14285714285714) internal successors, (1360), 13 states have internal predecessors, (1360), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 624 [2024-11-12 11:57:14,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 11:57:14,576 INFO L225 Difference]: With dead ends: 3428 [2024-11-12 11:57:14,576 INFO L226 Difference]: Without dead ends: 3397 [2024-11-12 11:57:14,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1261 GetRequests, 1249 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2024-11-12 11:57:14,580 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 6769 mSDsluCounter, 4926 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6873 SdHoareTripleChecker+Valid, 5481 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 11:57:14,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6873 Valid, 5481 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 11:57:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3397 states. [2024-11-12 11:57:14,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3397 to 3394. [2024-11-12 11:57:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3394 states, 3321 states have (on average 1.3706714844926227) internal successors, (4552), 3331 states have internal predecessors, (4552), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 61 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 11:57:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 4692 transitions. [2024-11-12 11:57:14,729 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 4692 transitions. Word has length 624 [2024-11-12 11:57:14,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 11:57:14,730 INFO L471 AbstractCegarLoop]: Abstraction has 3394 states and 4692 transitions. [2024-11-12 11:57:14,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 97.14285714285714) internal successors, (1360), 13 states have internal predecessors, (1360), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-12 11:57:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 4692 transitions. [2024-11-12 11:57:14,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1501 [2024-11-12 11:57:14,790 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 11:57:14,792 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 11:57:14,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 11:57:14,993 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,SelfDestructingSolverStorable7 [2024-11-12 11:57:14,993 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 11:57:14,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 11:57:14,997 INFO L85 PathProgramCache]: Analyzing trace with hash 938049912, now seen corresponding path program 2 times [2024-11-12 11:57:14,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 11:57:14,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607291250] [2024-11-12 11:57:14,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 11:57:14,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms