./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:20:04,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:20:04,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 06:20:04,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:20:04,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:20:05,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:20:05,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:20:05,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:20:05,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 06:20:05,039 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 06:20:05,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:20:05,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:20:05,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:20:05,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:20:05,045 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:20:05,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:20:05,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:20:05,045 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:20:05,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:20:05,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:20:05,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:20:05,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:20:05,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:20:05,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:20:05,051 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:20:05,051 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:20:05,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:20:05,052 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:20:05,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:20:05,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:20:05,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:20:05,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:20:05,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:20:05,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:20:05,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:20:05,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:20:05,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:20:05,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:20:05,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:20:05,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:20:05,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:20:05,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:20:05,075 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2024-11-09 06:20:05,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:20:05,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:20:05,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:20:05,385 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:20:05,385 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:20:05,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i [2024-11-09 06:20:06,943 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:20:07,279 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:20:07,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i [2024-11-09 06:20:07,295 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f596043f/61e60732be0e4ffd96280e191ebe39f5/FLAGa5ce56b5d [2024-11-09 06:20:07,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f596043f/61e60732be0e4ffd96280e191ebe39f5 [2024-11-09 06:20:07,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:20:07,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:20:07,317 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:20:07,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:20:07,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:20:07,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:20:07" (1/1) ... [2024-11-09 06:20:07,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d33385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:20:07, skipping insertion in model container [2024-11-09 06:20:07,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:20:07" (1/1) ... [2024-11-09 06:20:07,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:20:07,794 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_SAX_nondet_test4-1.i[33519,33532] [2024-11-09 06:20:07,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:20:07,952 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:20:07,992 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_SAX_nondet_test4-1.i[33519,33532] [2024-11-09 06:20:08,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:20:08,110 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:20:08,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:20:08 WrapperNode [2024-11-09 06:20:08,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:20:08,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:20:08,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:20:08,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:20:08,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:20:08" (1/1) ... [2024-11-09 06:20:08,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:20:08" (1/1) ... [2024-11-09 06:20:08,233 INFO L138 Inliner]: procedures = 176, calls = 325, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1549 [2024-11-09 06:20:08,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:20:08,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:20:08,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:20:08,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:20:08,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:20:08" (1/1) ... [2024-11-09 06:20:08,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:20:08" (1/1) ... [2024-11-09 06:20:08,257 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:20:08" (1/1) ... [2024-11-09 06:20:08,340 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-11-09 06:20:08,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:20:08" (1/1) ... [2024-11-09 06:20:08,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:20:08" (1/1) ... [2024-11-09 06:20:08,470 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:20:08" (1/1) ... [2024-11-09 06:20:08,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:20:08" (1/1) ... [2024-11-09 06:20:08,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:20:08" (1/1) ... [2024-11-09 06:20:08,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:20:08" (1/1) ... [2024-11-09 06:20:08,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:20:08,578 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:20:08,578 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:20:08,578 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:20:08,580 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:20:08" (1/1) ... [2024-11-09 06:20:08,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:20:08,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:20:08,614 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-09 06:20:08,620 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-09 06:20:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 06:20:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 06:20:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 06:20:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 06:20:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 06:20:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 06:20:08,672 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 06:20:08,673 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 06:20:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:20:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:20:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 06:20:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 06:20:08,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 06:20:08,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 06:20:08,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:20:08,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 06:20:08,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 06:20:08,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:20:08,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:20:08,911 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:20:08,913 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:20:10,535 INFO L? ?]: Removed 377 outVars from TransFormulas that were not future-live. [2024-11-09 06:20:10,536 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:20:10,562 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:20:10,565 INFO L316 CfgBuilder]: Removed 60 assume(true) statements. [2024-11-09 06:20:10,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:20:10 BoogieIcfgContainer [2024-11-09 06:20:10,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:20:10,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:20:10,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:20:10,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:20:10,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:20:07" (1/3) ... [2024-11-09 06:20:10,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@637da204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:20:10, skipping insertion in model container [2024-11-09 06:20:10,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:20:08" (2/3) ... [2024-11-09 06:20:10,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@637da204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:20:10, skipping insertion in model container [2024-11-09 06:20:10,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:20:10" (3/3) ... [2024-11-09 06:20:10,580 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test4-1.i [2024-11-09 06:20:10,596 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:20:10,597 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 06:20:10,680 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:20:10,691 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;@a456ee0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:20:10,691 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 06:20:10,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 404 states, 395 states have (on average 1.6126582278481012) internal successors, (637), 396 states have internal predecessors, (637), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:20:10,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 06:20:10,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:10,728 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:20:10,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:20:10,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:10,735 INFO L85 PathProgramCache]: Analyzing trace with hash -639633962, now seen corresponding path program 1 times [2024-11-09 06:20:10,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:20:10,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120919289] [2024-11-09 06:20:10,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:10,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:20:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:11,071 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-09 06:20:11,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:20:11,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120919289] [2024-11-09 06:20:11,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120919289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:11,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:20:11,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:20:11,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67580927] [2024-11-09 06:20:11,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:11,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:20:11,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:20:11,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:20:11,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:20:11,113 INFO L87 Difference]: Start difference. First operand has 404 states, 395 states have (on average 1.6126582278481012) internal successors, (637), 396 states have internal predecessors, (637), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:11,550 INFO L93 Difference]: Finished difference Result 1128 states and 1819 transitions. [2024-11-09 06:20:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:20:11,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 06:20:11,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:11,576 INFO L225 Difference]: With dead ends: 1128 [2024-11-09 06:20:11,576 INFO L226 Difference]: Without dead ends: 720 [2024-11-09 06:20:11,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:20:11,588 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 467 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:11,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1661 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:20:11,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-11-09 06:20:11,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2024-11-09 06:20:11,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 709 states have (on average 1.4541607898448519) internal successors, (1031), 709 states have internal predecessors, (1031), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 06:20:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1049 transitions. [2024-11-09 06:20:11,690 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1049 transitions. Word has length 10 [2024-11-09 06:20:11,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:11,691 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1049 transitions. [2024-11-09 06:20:11,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1049 transitions. [2024-11-09 06:20:11,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:20:11,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:11,699 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:20:11,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:20:11,700 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:20:11,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:11,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1430695505, now seen corresponding path program 1 times [2024-11-09 06:20:11,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:20:11,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103388690] [2024-11-09 06:20:11,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:11,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:20:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:12,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 06:20:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:12,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 06:20:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:12,414 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-09 06:20:12,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:20:12,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103388690] [2024-11-09 06:20:12,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103388690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:12,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:20:12,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:20:12,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713788168] [2024-11-09 06:20:12,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:12,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:20:12,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:20:12,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:20:12,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:20:12,419 INFO L87 Difference]: Start difference. First operand 720 states and 1049 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:20:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:12,928 INFO L93 Difference]: Finished difference Result 1389 states and 2027 transitions. [2024-11-09 06:20:12,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:20:12,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2024-11-09 06:20:12,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:12,935 INFO L225 Difference]: With dead ends: 1389 [2024-11-09 06:20:12,937 INFO L226 Difference]: Without dead ends: 729 [2024-11-09 06:20:12,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:20:12,941 INFO L432 NwaCegarLoop]: 547 mSDtfsCounter, 108 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:12,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1996 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:20:12,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-11-09 06:20:12,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 720. [2024-11-09 06:20:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 709 states have (on average 1.4344146685472496) internal successors, (1017), 709 states have internal predecessors, (1017), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 06:20:12,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1035 transitions. [2024-11-09 06:20:12,991 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1035 transitions. Word has length 171 [2024-11-09 06:20:12,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:12,994 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1035 transitions. [2024-11-09 06:20:12,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:20:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1035 transitions. [2024-11-09 06:20:12,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:20:13,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:13,000 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:20:13,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:20:13,001 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:20:13,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:13,001 INFO L85 PathProgramCache]: Analyzing trace with hash -21705053, now seen corresponding path program 1 times [2024-11-09 06:20:13,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:20:13,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731972964] [2024-11-09 06:20:13,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:13,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:20:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:13,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 06:20:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:13,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 06:20:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:13,390 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-09 06:20:13,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:20:13,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731972964] [2024-11-09 06:20:13,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731972964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:13,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:20:13,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:20:13,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376363805] [2024-11-09 06:20:13,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:13,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:20:13,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:20:13,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:20:13,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:20:13,395 INFO L87 Difference]: Start difference. First operand 720 states and 1035 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:20:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:13,758 INFO L93 Difference]: Finished difference Result 1379 states and 1994 transitions. [2024-11-09 06:20:13,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:20:13,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2024-11-09 06:20:13,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:13,763 INFO L225 Difference]: With dead ends: 1379 [2024-11-09 06:20:13,763 INFO L226 Difference]: Without dead ends: 735 [2024-11-09 06:20:13,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-09 06:20:13,766 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 4 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:13,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1567 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:20:13,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-11-09 06:20:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 732. [2024-11-09 06:20:13,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 721 states have (on average 1.4271844660194175) internal successors, (1029), 721 states have internal predecessors, (1029), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 06:20:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1047 transitions. [2024-11-09 06:20:13,789 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1047 transitions. Word has length 171 [2024-11-09 06:20:13,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:13,790 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 1047 transitions. [2024-11-09 06:20:13,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:20:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1047 transitions. [2024-11-09 06:20:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:20:13,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:13,793 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:20:13,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:20:13,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:20:13,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:13,794 INFO L85 PathProgramCache]: Analyzing trace with hash 518724453, now seen corresponding path program 1 times [2024-11-09 06:20:13,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:20:13,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833013942] [2024-11-09 06:20:13,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:13,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:20:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:14,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 06:20:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:14,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 06:20:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:14,076 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-09 06:20:14,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:20:14,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833013942] [2024-11-09 06:20:14,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833013942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:14,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:20:14,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:20:14,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703093104] [2024-11-09 06:20:14,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:14,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:20:14,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:20:14,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:20:14,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:20:14,082 INFO L87 Difference]: Start difference. First operand 732 states and 1047 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:20:14,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:14,415 INFO L93 Difference]: Finished difference Result 1317 states and 1894 transitions. [2024-11-09 06:20:14,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:20:14,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 171 [2024-11-09 06:20:14,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:14,420 INFO L225 Difference]: With dead ends: 1317 [2024-11-09 06:20:14,420 INFO L226 Difference]: Without dead ends: 733 [2024-11-09 06:20:14,421 INFO L431 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-09 06:20:14,422 INFO L432 NwaCegarLoop]: 567 mSDtfsCounter, 137 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:14,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1594 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:20:14,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-11-09 06:20:14,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 730. [2024-11-09 06:20:14,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 719 states have (on average 1.426981919332406) internal successors, (1026), 719 states have internal predecessors, (1026), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 06:20:14,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1044 transitions. [2024-11-09 06:20:14,447 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1044 transitions. Word has length 171 [2024-11-09 06:20:14,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:14,449 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1044 transitions. [2024-11-09 06:20:14,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 06:20:14,449 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1044 transitions. [2024-11-09 06:20:14,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-09 06:20:14,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:14,452 INFO L215 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-09 06:20:14,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:20:14,453 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:20:14,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:14,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1195148215, now seen corresponding path program 1 times [2024-11-09 06:20:14,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:20:14,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308689363] [2024-11-09 06:20:14,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:14,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:20:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:14,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:20:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:14,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:20:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:14,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-09 06:20:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:14,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-09 06:20:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 06:20:14,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:20:14,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308689363] [2024-11-09 06:20:14,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308689363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:14,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:20:14,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:20:14,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673456426] [2024-11-09 06:20:14,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:14,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:20:14,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:20:14,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:20:14,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:20:14,949 INFO L87 Difference]: Start difference. First operand 730 states and 1044 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 4 states have internal predecessors, (169), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 06:20:15,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:15,562 INFO L93 Difference]: Finished difference Result 1176 states and 1686 transitions. [2024-11-09 06:20:15,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:20:15,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 4 states have internal predecessors, (169), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 186 [2024-11-09 06:20:15,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:15,569 INFO L225 Difference]: With dead ends: 1176 [2024-11-09 06:20:15,571 INFO L226 Difference]: Without dead ends: 649 [2024-11-09 06:20:15,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-09 06:20:15,573 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 33 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:15,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1753 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:20:15,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-09 06:20:15,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 646. [2024-11-09 06:20:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 635 states have (on average 1.373228346456693) internal successors, (872), 635 states have internal predecessors, (872), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 06:20:15,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 890 transitions. [2024-11-09 06:20:15,600 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 890 transitions. Word has length 186 [2024-11-09 06:20:15,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:15,600 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 890 transitions. [2024-11-09 06:20:15,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 4 states have internal predecessors, (169), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 06:20:15,601 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 890 transitions. [2024-11-09 06:20:15,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-09 06:20:15,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:15,604 INFO L215 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-09 06:20:15,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:20:15,604 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:20:15,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:15,605 INFO L85 PathProgramCache]: Analyzing trace with hash -988184509, now seen corresponding path program 1 times [2024-11-09 06:20:15,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:20:15,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359329988] [2024-11-09 06:20:15,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:15,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:20:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:16,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:20:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:16,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:20:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:16,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-09 06:20:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:16,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-09 06:20:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 06:20:16,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:20:16,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359329988] [2024-11-09 06:20:16,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359329988] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:20:16,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310771290] [2024-11-09 06:20:16,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:16,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:20:16,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:20:16,881 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-09 06:20:16,882 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-09 06:20:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:17,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 06:20:17,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:17,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2024-11-09 06:20:17,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:20:17,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 43 [2024-11-09 06:20:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 06:20:18,066 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:20:18,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310771290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:18,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:20:18,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-09 06:20:18,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667315938] [2024-11-09 06:20:18,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:18,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 06:20:18,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:20:18,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 06:20:18,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:20:18,069 INFO L87 Difference]: Start difference. First operand 646 states and 890 transitions. Second operand has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:20:20,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:20,438 INFO L93 Difference]: Finished difference Result 1303 states and 1784 transitions. [2024-11-09 06:20:20,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:20:20,438 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 186 [2024-11-09 06:20:20,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:20,442 INFO L225 Difference]: With dead ends: 1303 [2024-11-09 06:20:20,443 INFO L226 Difference]: Without dead ends: 749 [2024-11-09 06:20:20,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2024-11-09 06:20:20,446 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 723 mSDsluCounter, 2627 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 3097 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:20,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 3097 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 06:20:20,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2024-11-09 06:20:20,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 678. [2024-11-09 06:20:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 667 states have (on average 1.3628185907046477) internal successors, (909), 667 states have internal predecessors, (909), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 06:20:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 927 transitions. [2024-11-09 06:20:20,473 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 927 transitions. Word has length 186 [2024-11-09 06:20:20,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:20,474 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 927 transitions. [2024-11-09 06:20:20,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:20:20,475 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 927 transitions. [2024-11-09 06:20:20,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-09 06:20:20,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:20,477 INFO L215 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-09 06:20:20,504 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-09 06:20:20,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 06:20:20,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:20:20,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:20,683 INFO L85 PathProgramCache]: Analyzing trace with hash 415684677, now seen corresponding path program 1 times [2024-11-09 06:20:20,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:20:20,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309194484] [2024-11-09 06:20:20,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:20,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:20:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:21,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:20:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:21,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:20:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:21,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-09 06:20:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:21,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-09 06:20:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:21,063 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 06:20:21,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:20:21,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309194484] [2024-11-09 06:20:21,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309194484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:21,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:20:21,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:20:21,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326778354] [2024-11-09 06:20:21,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:21,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:20:21,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:20:21,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:20:21,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:20:21,068 INFO L87 Difference]: Start difference. First operand 678 states and 927 transitions. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:20:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:21,402 INFO L93 Difference]: Finished difference Result 1187 states and 1626 transitions. [2024-11-09 06:20:21,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:20:21,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 186 [2024-11-09 06:20:21,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:21,406 INFO L225 Difference]: With dead ends: 1187 [2024-11-09 06:20:21,407 INFO L226 Difference]: Without dead ends: 541 [2024-11-09 06:20:21,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-09 06:20:21,409 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 12 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:21,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1450 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:20:21,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-09 06:20:21,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 538. [2024-11-09 06:20:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 527 states have (on average 1.3263757115749526) internal successors, (699), 527 states have internal predecessors, (699), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 06:20:21,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 717 transitions. [2024-11-09 06:20:21,428 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 717 transitions. Word has length 186 [2024-11-09 06:20:21,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:21,428 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 717 transitions. [2024-11-09 06:20:21,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:20:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 717 transitions. [2024-11-09 06:20:21,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-09 06:20:21,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:21,431 INFO L215 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, 1] [2024-11-09 06:20:21,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:20:21,432 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:20:21,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:21,432 INFO L85 PathProgramCache]: Analyzing trace with hash 854784811, now seen corresponding path program 1 times [2024-11-09 06:20:21,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:20:21,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047105321] [2024-11-09 06:20:21,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:21,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:20:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:22,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 06:20:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:22,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 06:20:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:22,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-09 06:20:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:22,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-09 06:20:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 06:20:22,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:20:22,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047105321] [2024-11-09 06:20:22,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047105321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:20:22,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450052607] [2024-11-09 06:20:22,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:22,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:20:22,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:20:22,750 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-09 06:20:22,775 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-09 06:20:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:23,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 06:20:23,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 06:20:23,433 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:20:23,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450052607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:23,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:20:23,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-09 06:20:23,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247284690] [2024-11-09 06:20:23,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:23,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:20:23,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:20:23,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:20:23,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:20:23,437 INFO L87 Difference]: Start difference. First operand 538 states and 717 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:20:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:23,554 INFO L93 Difference]: Finished difference Result 1038 states and 1394 transitions. [2024-11-09 06:20:23,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:20:23,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 187 [2024-11-09 06:20:23,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:23,559 INFO L225 Difference]: With dead ends: 1038 [2024-11-09 06:20:23,559 INFO L226 Difference]: Without dead ends: 538 [2024-11-09 06:20:23,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:20:23,562 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 13 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:23,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1063 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:20:23,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-09 06:20:23,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2024-11-09 06:20:23,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 527 states have (on average 1.3225806451612903) internal successors, (697), 527 states have internal predecessors, (697), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 06:20:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 715 transitions. [2024-11-09 06:20:23,584 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 715 transitions. Word has length 187 [2024-11-09 06:20:23,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:23,584 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 715 transitions. [2024-11-09 06:20:23,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:20:23,585 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 715 transitions. [2024-11-09 06:20:23,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-09 06:20:23,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:23,587 INFO L215 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, 1, 1] [2024-11-09 06:20:23,612 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-09 06:20:23,788 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-09 06:20:23,788 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:20:23,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:23,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1701840994, now seen corresponding path program 1 times [2024-11-09 06:20:23,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:20:23,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265739342] [2024-11-09 06:20:23,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:23,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:20:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:24,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 06:20:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:24,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 06:20:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:24,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-09 06:20:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:24,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-09 06:20:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 06:20:24,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:20:24,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265739342] [2024-11-09 06:20:24,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265739342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:24,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:20:24,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:20:24,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125079739] [2024-11-09 06:20:24,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:24,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:20:24,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:20:24,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:20:24,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:20:24,387 INFO L87 Difference]: Start difference. First operand 538 states and 715 transitions. Second operand has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:20:24,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:24,947 INFO L93 Difference]: Finished difference Result 1044 states and 1408 transitions. [2024-11-09 06:20:24,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:20:24,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 188 [2024-11-09 06:20:24,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:24,951 INFO L225 Difference]: With dead ends: 1044 [2024-11-09 06:20:24,951 INFO L226 Difference]: Without dead ends: 547 [2024-11-09 06:20:24,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:20:24,955 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 7 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:24,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1981 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:20:24,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-11-09 06:20:24,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 544. [2024-11-09 06:20:24,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 533 states have (on average 1.3189493433395871) internal successors, (703), 533 states have internal predecessors, (703), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 06:20:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 721 transitions. [2024-11-09 06:20:24,973 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 721 transitions. Word has length 188 [2024-11-09 06:20:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:24,973 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 721 transitions. [2024-11-09 06:20:24,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 6 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:20:24,974 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 721 transitions. [2024-11-09 06:20:24,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-09 06:20:24,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:24,976 INFO L215 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, 1, 1, 1] [2024-11-09 06:20:24,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:20:24,976 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:20:24,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:24,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1654246724, now seen corresponding path program 1 times [2024-11-09 06:20:24,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:20:24,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274007766] [2024-11-09 06:20:24,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:24,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:20:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:25,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 06:20:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:25,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 06:20:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:25,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 06:20:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:25,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-09 06:20:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 06:20:25,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:20:25,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274007766] [2024-11-09 06:20:25,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274007766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:25,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:20:25,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:20:25,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999597382] [2024-11-09 06:20:25,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:25,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:20:25,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:20:25,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:20:25,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:20:25,538 INFO L87 Difference]: Start difference. First operand 544 states and 721 transitions. Second operand has 8 states, 8 states have (on average 21.5) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:20:26,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:26,116 INFO L93 Difference]: Finished difference Result 1050 states and 1412 transitions. [2024-11-09 06:20:26,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:20:26,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 189 [2024-11-09 06:20:26,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:26,122 INFO L225 Difference]: With dead ends: 1050 [2024-11-09 06:20:26,122 INFO L226 Difference]: Without dead ends: 557 [2024-11-09 06:20:26,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:20:26,124 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 11 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:26,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2281 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:20:26,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-09 06:20:26,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 552. [2024-11-09 06:20:26,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 541 states have (on average 1.3179297597042514) internal successors, (713), 541 states have internal predecessors, (713), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 06:20:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 731 transitions. [2024-11-09 06:20:26,144 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 731 transitions. Word has length 189 [2024-11-09 06:20:26,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:26,145 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 731 transitions. [2024-11-09 06:20:26,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 7 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 06:20:26,145 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 731 transitions. [2024-11-09 06:20:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-09 06:20:26,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:26,147 INFO L215 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, 1, 1, 1] [2024-11-09 06:20:26,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:20:26,148 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:20:26,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:26,149 INFO L85 PathProgramCache]: Analyzing trace with hash -806328792, now seen corresponding path program 1 times [2024-11-09 06:20:26,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:20:26,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590353182] [2024-11-09 06:20:26,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:26,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:20:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:26,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 06:20:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:27,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 06:20:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:27,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 06:20:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:27,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-09 06:20:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 06:20:27,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:20:27,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590353182] [2024-11-09 06:20:27,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590353182] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:20:27,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132228341] [2024-11-09 06:20:27,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:27,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:20:27,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:20:27,018 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:20:27,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:20:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:27,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 06:20:27,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 06:20:27,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:20:27,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132228341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:27,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:20:27,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-09 06:20:27,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775400038] [2024-11-09 06:20:27,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:27,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:20:27,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:20:27,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:20:27,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:20:27,755 INFO L87 Difference]: Start difference. First operand 552 states and 731 transitions. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 06:20:27,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:27,849 INFO L93 Difference]: Finished difference Result 1074 states and 1437 transitions. [2024-11-09 06:20:27,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:20:27,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 189 [2024-11-09 06:20:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:27,853 INFO L225 Difference]: With dead ends: 1074 [2024-11-09 06:20:27,853 INFO L226 Difference]: Without dead ends: 617 [2024-11-09 06:20:27,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:20:27,855 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 367 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:27,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1582 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:20:27,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-09 06:20:27,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 555. [2024-11-09 06:20:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 543 states have (on average 1.3186003683241252) internal successors, (716), 544 states have internal predecessors, (716), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 06:20:27,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 737 transitions. [2024-11-09 06:20:27,879 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 737 transitions. Word has length 189 [2024-11-09 06:20:27,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:27,879 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 737 transitions. [2024-11-09 06:20:27,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 06:20:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 737 transitions. [2024-11-09 06:20:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-09 06:20:27,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:27,883 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1] [2024-11-09 06:20:27,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 06:20:28,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:20:28,085 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:20:28,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:28,085 INFO L85 PathProgramCache]: Analyzing trace with hash -743999516, now seen corresponding path program 1 times [2024-11-09 06:20:28,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:20:28,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009102091] [2024-11-09 06:20:28,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:28,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:20:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:29,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 06:20:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:29,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 06:20:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:29,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-09 06:20:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:29,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-09 06:20:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:29,148 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 06:20:29,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:20:29,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009102091] [2024-11-09 06:20:29,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009102091] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:20:29,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379046657] [2024-11-09 06:20:29,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:29,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:20:29,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:20:29,151 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:20:29,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:20:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:29,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 265 conjuncts are in the unsatisfiable core [2024-11-09 06:20:29,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:29,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:20:29,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-09 06:20:30,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2024-11-09 06:20:30,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2024-11-09 06:20:30,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2024-11-09 06:20:30,622 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-11-09 06:20:30,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2024-11-09 06:20:30,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:20:30,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-11-09 06:20:30,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:20:30,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-09 06:20:30,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 06:20:30,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:20:30,992 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:20:30,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2024-11-09 06:20:31,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:20:31,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 21 [2024-11-09 06:20:35,874 INFO L224 Elim1Store]: Index analysis took 190 ms