./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-2.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_SFH_nondet_test4-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c763f0e5b490114d32e3c1ec14f736caee058b985a7ee61f4d14ad6758e2996 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:23:23,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:23:23,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 06:23:23,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:23:23,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:23:23,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:23:23,389 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:23:23,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:23:23,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 06:23:23,391 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 06:23:23,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:23:23,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:23:23,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:23:23,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:23:23,395 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:23:23,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:23:23,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:23:23,396 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:23:23,396 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:23:23,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:23:23,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:23:23,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:23:23,401 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:23:23,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:23:23,402 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:23:23,402 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:23:23,402 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:23:23,402 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:23:23,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:23:23,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:23:23,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:23:23,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:23:23,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:23:23,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:23:23,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:23:23,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:23:23,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:23:23,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:23:23,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:23:23,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:23:23,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:23:23,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:23:23,407 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 -> 6c763f0e5b490114d32e3c1ec14f736caee058b985a7ee61f4d14ad6758e2996 [2024-11-09 06:23:23,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:23:23,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:23:23,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:23:23,741 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:23:23,741 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:23:23,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-2.i [2024-11-09 06:23:25,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:23:25,594 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:23:25,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-2.i [2024-11-09 06:23:25,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760e889fb/54ced1b553584c359fae4165d890c0ae/FLAGdcd45539c [2024-11-09 06:23:25,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760e889fb/54ced1b553584c359fae4165d890c0ae [2024-11-09 06:23:25,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:23:25,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:23:25,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:23:25,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:23:25,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:23:25,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:23:25" (1/1) ... [2024-11-09 06:23:25,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dddda6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:23:25, skipping insertion in model container [2024-11-09 06:23:25,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:23:25" (1/1) ... [2024-11-09 06:23:25,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:23:26,446 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_SFH_nondet_test4-2.i[33519,33532] [2024-11-09 06:23:26,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:23:26,616 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:23:26,657 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_SFH_nondet_test4-2.i[33519,33532] [2024-11-09 06:23:26,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:23:26,787 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:23:26,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:23:26 WrapperNode [2024-11-09 06:23:26,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:23:26,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:23:26,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:23:26,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:23:26,800 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:23:26" (1/1) ... [2024-11-09 06:23:26,838 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:23:26" (1/1) ... [2024-11-09 06:23:26,925 INFO L138 Inliner]: procedures = 176, calls = 376, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1715 [2024-11-09 06:23:26,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:23:26,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:23:26,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:23:26,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:23:26,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:23:26" (1/1) ... [2024-11-09 06:23:26,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:23:26" (1/1) ... [2024-11-09 06:23:26,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:23:26" (1/1) ... [2024-11-09 06:23:27,103 INFO L175 MemorySlicer]: Split 357 memory accesses to 2 slices as follows [2, 355]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 90 writes are split as follows [0, 90]. [2024-11-09 06:23:27,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:23:26" (1/1) ... [2024-11-09 06:23:27,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:23:26" (1/1) ... [2024-11-09 06:23:27,239 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:23:26" (1/1) ... [2024-11-09 06:23:27,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:23:26" (1/1) ... [2024-11-09 06:23:27,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:23:26" (1/1) ... [2024-11-09 06:23:27,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:23:26" (1/1) ... [2024-11-09 06:23:27,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:23:27,349 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:23:27,349 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:23:27,350 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:23:27,350 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:23:26" (1/1) ... [2024-11-09 06:23:27,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:23:27,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:23:27,387 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:23:27,391 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:23:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 06:23:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 06:23:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 06:23:27,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 06:23:27,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 06:23:27,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 06:23:27,454 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 06:23:27,454 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 06:23:27,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:23:27,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:23:27,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 06:23:27,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 06:23:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 06:23:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 06:23:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:23:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 06:23:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 06:23:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:23:27,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:23:27,720 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:23:27,726 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:23:29,499 INFO L? ?]: Removed 404 outVars from TransFormulas that were not future-live. [2024-11-09 06:23:29,499 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:23:29,534 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:23:29,537 INFO L316 CfgBuilder]: Removed 69 assume(true) statements. [2024-11-09 06:23:29,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:23:29 BoogieIcfgContainer [2024-11-09 06:23:29,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:23:29,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:23:29,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:23:29,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:23:29,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:23:25" (1/3) ... [2024-11-09 06:23:29,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b72bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:23:29, skipping insertion in model container [2024-11-09 06:23:29,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:23:26" (2/3) ... [2024-11-09 06:23:29,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b72bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:23:29, skipping insertion in model container [2024-11-09 06:23:29,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:23:29" (3/3) ... [2024-11-09 06:23:29,547 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test4-2.i [2024-11-09 06:23:29,565 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:23:29,566 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 06:23:29,648 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:23:29,654 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;@dcb13a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:23:29,655 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 06:23:29,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 439 states, 430 states have (on average 1.613953488372093) internal successors, (694), 431 states have internal predecessors, (694), 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:23:29,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 06:23:29,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:23:29,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:23:29,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:23:29,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:23:29,681 INFO L85 PathProgramCache]: Analyzing trace with hash -639633962, now seen corresponding path program 1 times [2024-11-09 06:23:29,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:23:29,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387500343] [2024-11-09 06:23:29,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:23:29,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:23:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:30,044 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:23:30,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:23:30,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387500343] [2024-11-09 06:23:30,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387500343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:23:30,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:23:30,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:23:30,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986725524] [2024-11-09 06:23:30,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:23:30,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:23:30,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:23:30,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:23:30,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:23:30,090 INFO L87 Difference]: Start difference. First operand has 439 states, 430 states have (on average 1.613953488372093) internal successors, (694), 431 states have internal predecessors, (694), 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:23:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:23:30,576 INFO L93 Difference]: Finished difference Result 1198 states and 1933 transitions. [2024-11-09 06:23:30,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:23:30,579 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:23:30,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:23:30,597 INFO L225 Difference]: With dead ends: 1198 [2024-11-09 06:23:30,598 INFO L226 Difference]: Without dead ends: 720 [2024-11-09 06:23:30,602 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:23:30,605 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 467 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:23:30,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1799 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:23:30,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-11-09 06:23:30,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2024-11-09 06:23:30,692 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:23:30,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1049 transitions. [2024-11-09 06:23:30,702 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1049 transitions. Word has length 10 [2024-11-09 06:23:30,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:23:30,703 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1049 transitions. [2024-11-09 06:23:30,703 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:23:30,703 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1049 transitions. [2024-11-09 06:23:30,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:23:30,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:23:30,716 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:23:30,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:23:30,717 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:23:30,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:23:30,718 INFO L85 PathProgramCache]: Analyzing trace with hash 811678255, now seen corresponding path program 1 times [2024-11-09 06:23:30,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:23:30,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435385868] [2024-11-09 06:23:30,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:23:30,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:23:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:31,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 06:23:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:31,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 06:23:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:31,472 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:23:31,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:23:31,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435385868] [2024-11-09 06:23:31,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435385868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:23:31,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:23:31,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:23:31,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122418006] [2024-11-09 06:23:31,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:23:31,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:23:31,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:23:31,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:23:31,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:23:31,477 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:23:31,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:23:31,955 INFO L93 Difference]: Finished difference Result 1389 states and 2027 transitions. [2024-11-09 06:23:31,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:23:31,956 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:23:31,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:23:31,963 INFO L225 Difference]: With dead ends: 1389 [2024-11-09 06:23:31,964 INFO L226 Difference]: Without dead ends: 729 [2024-11-09 06:23:31,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:23:31,970 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.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:23:31,971 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.4s Time] [2024-11-09 06:23:31,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-11-09 06:23:32,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 720. [2024-11-09 06:23:32,012 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:23:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1035 transitions. [2024-11-09 06:23:32,017 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1035 transitions. Word has length 171 [2024-11-09 06:23:32,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:23:32,018 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1035 transitions. [2024-11-09 06:23:32,018 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:23:32,018 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1035 transitions. [2024-11-09 06:23:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:23:32,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:23:32,027 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:23:32,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:23:32,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:23:32,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:23:32,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2074298589, now seen corresponding path program 1 times [2024-11-09 06:23:32,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:23:32,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840444399] [2024-11-09 06:23:32,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:23:32,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:23:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:32,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 06:23:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:32,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 06:23:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:32,422 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:23:32,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:23:32,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840444399] [2024-11-09 06:23:32,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840444399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:23:32,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:23:32,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:23:32,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572344760] [2024-11-09 06:23:32,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:23:32,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:23:32,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:23:32,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:23:32,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:23:32,430 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:23:32,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:23:32,850 INFO L93 Difference]: Finished difference Result 1379 states and 1994 transitions. [2024-11-09 06:23:32,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:23:32,851 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:23:32,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:23:32,858 INFO L225 Difference]: With dead ends: 1379 [2024-11-09 06:23:32,858 INFO L226 Difference]: Without dead ends: 735 [2024-11-09 06:23:32,860 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:23:32,861 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.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:23:32,861 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.4s Time] [2024-11-09 06:23:32,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-11-09 06:23:32,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 732. [2024-11-09 06:23:32,888 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:23:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1047 transitions. [2024-11-09 06:23:32,893 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1047 transitions. Word has length 171 [2024-11-09 06:23:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:23:32,893 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 1047 transitions. [2024-11-09 06:23:32,893 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:23:32,895 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1047 transitions. [2024-11-09 06:23:32,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 06:23:32,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:23:32,899 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:23:32,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:23:32,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:23:32,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:23:32,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1533869083, now seen corresponding path program 1 times [2024-11-09 06:23:32,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:23:32,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115322812] [2024-11-09 06:23:32,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:23:32,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:23:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:33,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 06:23:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:33,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 06:23:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:33,216 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:23:33,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:23:33,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115322812] [2024-11-09 06:23:33,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115322812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:23:33,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:23:33,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:23:33,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027900925] [2024-11-09 06:23:33,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:23:33,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:23:33,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:23:33,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:23:33,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:23:33,220 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:23:33,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:23:33,590 INFO L93 Difference]: Finished difference Result 1317 states and 1894 transitions. [2024-11-09 06:23:33,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:23:33,591 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:23:33,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:23:33,598 INFO L225 Difference]: With dead ends: 1317 [2024-11-09 06:23:33,599 INFO L226 Difference]: Without dead ends: 733 [2024-11-09 06:23:33,601 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:23:33,602 INFO L432 NwaCegarLoop]: 567 mSDtfsCounter, 137 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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:23:33,602 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:23:33,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-11-09 06:23:33,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 730. [2024-11-09 06:23:33,628 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:23:33,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1044 transitions. [2024-11-09 06:23:33,634 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1044 transitions. Word has length 171 [2024-11-09 06:23:33,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:23:33,635 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1044 transitions. [2024-11-09 06:23:33,635 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:23:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1044 transitions. [2024-11-09 06:23:33,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-09 06:23:33,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:23:33,638 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:23:33,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:23:33,639 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:23:33,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:23:33,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2121725111, now seen corresponding path program 1 times [2024-11-09 06:23:33,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:23:33,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301259575] [2024-11-09 06:23:33,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:23:33,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:23:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:34,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:23:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:34,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:23:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:34,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-09 06:23:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:34,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-09 06:23:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:34,156 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:23:34,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:23:34,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301259575] [2024-11-09 06:23:34,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301259575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:23:34,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:23:34,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:23:34,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488185631] [2024-11-09 06:23:34,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:23:34,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:23:34,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:23:34,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:23:34,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:23:34,160 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:23:34,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:23:34,589 INFO L93 Difference]: Finished difference Result 1176 states and 1686 transitions. [2024-11-09 06:23:34,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:23:34,590 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:23:34,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:23:34,596 INFO L225 Difference]: With dead ends: 1176 [2024-11-09 06:23:34,596 INFO L226 Difference]: Without dead ends: 649 [2024-11-09 06:23:34,598 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:23:34,598 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 33 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:23:34,599 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.4s Time] [2024-11-09 06:23:34,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-09 06:23:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 646. [2024-11-09 06:23:34,623 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:23:34,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 890 transitions. [2024-11-09 06:23:34,628 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 890 transitions. Word has length 186 [2024-11-09 06:23:34,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:23:34,629 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 890 transitions. [2024-11-09 06:23:34,632 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:23:34,632 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 890 transitions. [2024-11-09 06:23:34,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-09 06:23:34,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:23:34,635 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:23:34,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:23:34,635 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:23:34,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:23:34,636 INFO L85 PathProgramCache]: Analyzing trace with hash -61607613, now seen corresponding path program 1 times [2024-11-09 06:23:34,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:23:34,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999209248] [2024-11-09 06:23:34,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:23:34,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:23:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:36,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:23:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:36,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:23:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:36,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-09 06:23:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:36,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-09 06:23:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:36,098 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:23:36,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:23:36,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999209248] [2024-11-09 06:23:36,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999209248] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:23:36,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178159876] [2024-11-09 06:23:36,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:23:36,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:23:36,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:23:36,103 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:23:36,105 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:23:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:23:36,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 06:23:36,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:23:36,808 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:23:37,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:23:37,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 38 [2024-11-09 06:23:37,628 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:23:37,629 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:23:37,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178159876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:23:37,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:23:37,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2024-11-09 06:23:37,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118294631] [2024-11-09 06:23:37,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:23:37,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 06:23:37,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:23:37,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 06:23:37,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-09 06:23:37,632 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:23:41,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:23:50,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:23:54,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:23:58,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:24:02,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:24:06,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:24:10,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:24:15,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:24:19,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:24:22,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:22,028 INFO L93 Difference]: Finished difference Result 1303 states and 1784 transitions. [2024-11-09 06:24:22,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:24:22,029 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:24:22,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:22,033 INFO L225 Difference]: With dead ends: 1303 [2024-11-09 06:24:22,033 INFO L226 Difference]: Without dead ends: 749 [2024-11-09 06:24:22,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=92, Invalid=369, Unknown=1, NotChecked=0, Total=462 [2024-11-09 06:24:22,037 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 723 mSDsluCounter, 2586 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 7 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 3056 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:24:22,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 3056 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1359 Invalid, 9 Unknown, 0 Unchecked, 39.6s Time] [2024-11-09 06:24:22,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2024-11-09 06:24:22,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 678. [2024-11-09 06:24:22,064 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:24:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 927 transitions. [2024-11-09 06:24:22,069 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 927 transitions. Word has length 186 [2024-11-09 06:24:22,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:22,070 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 927 transitions. [2024-11-09 06:24:22,070 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:24:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 927 transitions. [2024-11-09 06:24:22,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-09 06:24:22,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:22,073 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:24:22,101 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:24:22,274 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:24:22,275 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:22,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:22,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1342261573, now seen corresponding path program 1 times [2024-11-09 06:24:22,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:22,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272449569] [2024-11-09 06:24:22,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:22,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:22,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 06:24:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:22,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 06:24:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:22,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-09 06:24:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:22,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-09 06:24:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:22,678 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:24:22,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:24:22,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272449569] [2024-11-09 06:24:22,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272449569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:24:22,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:24:22,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:24:22,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768254057] [2024-11-09 06:24:22,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:24:22,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:24:22,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:24:22,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:24:22,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:24:22,683 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:24:23,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:23,270 INFO L93 Difference]: Finished difference Result 1187 states and 1626 transitions. [2024-11-09 06:24:23,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:24:23,271 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:24:23,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:23,275 INFO L225 Difference]: With dead ends: 1187 [2024-11-09 06:24:23,276 INFO L226 Difference]: Without dead ends: 541 [2024-11-09 06:24:23,277 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:24:23,278 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 12 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:24:23,278 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.5s Time] [2024-11-09 06:24:23,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-09 06:24:23,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 538. [2024-11-09 06:24:23,301 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:24:23,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 717 transitions. [2024-11-09 06:24:23,303 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 717 transitions. Word has length 186 [2024-11-09 06:24:23,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:23,304 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 717 transitions. [2024-11-09 06:24:23,305 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:24:23,305 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 717 transitions. [2024-11-09 06:24:23,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-09 06:24:23,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:23,307 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:24:23,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:24:23,307 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:23,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:23,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1781361707, now seen corresponding path program 1 times [2024-11-09 06:24:23,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:23,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075478046] [2024-11-09 06:24:23,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:23,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:24,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 06:24:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:24,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 06:24:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:24,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-09 06:24:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:24,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-09 06:24:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:24,446 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:24:24,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:24:24,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075478046] [2024-11-09 06:24:24,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075478046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:24:24,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477396520] [2024-11-09 06:24:24,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:24,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:24:24,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:24:24,450 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:24:24,452 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:24:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:25,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 06:24:25,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:24:25,209 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:24:25,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:24:25,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477396520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:24:25,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:24:25,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-09 06:24:25,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410191541] [2024-11-09 06:24:25,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:24:25,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:24:25,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:24:25,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:24:25,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:24:25,213 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:24:25,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:25,409 INFO L93 Difference]: Finished difference Result 1038 states and 1394 transitions. [2024-11-09 06:24:25,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:24:25,410 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:24:25,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:25,412 INFO L225 Difference]: With dead ends: 1038 [2024-11-09 06:24:25,413 INFO L226 Difference]: Without dead ends: 538 [2024-11-09 06:24:25,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:24:25,415 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 13 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:24:25,415 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.2s Time] [2024-11-09 06:24:25,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-09 06:24:25,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2024-11-09 06:24:25,432 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:24:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 715 transitions. [2024-11-09 06:24:25,435 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 715 transitions. Word has length 187 [2024-11-09 06:24:25,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:25,436 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 715 transitions. [2024-11-09 06:24:25,436 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:24:25,436 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 715 transitions. [2024-11-09 06:24:25,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-09 06:24:25,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:25,438 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:24:25,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 06:24:25,639 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:24:25,640 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:25,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:25,640 INFO L85 PathProgramCache]: Analyzing trace with hash -775264098, now seen corresponding path program 1 times [2024-11-09 06:24:25,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:25,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673527300] [2024-11-09 06:24:25,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:25,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:26,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 06:24:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:26,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 06:24:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:26,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-09 06:24:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:26,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-09 06:24:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:26,301 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:24:26,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:24:26,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673527300] [2024-11-09 06:24:26,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673527300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:24:26,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:24:26,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:24:26,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793841404] [2024-11-09 06:24:26,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:24:26,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:24:26,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:24:26,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:24:26,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:24:26,305 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:24:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:27,221 INFO L93 Difference]: Finished difference Result 1044 states and 1408 transitions. [2024-11-09 06:24:27,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:24:27,221 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:24:27,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:27,224 INFO L225 Difference]: With dead ends: 1044 [2024-11-09 06:24:27,224 INFO L226 Difference]: Without dead ends: 547 [2024-11-09 06:24:27,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:24:27,226 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 7 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:24:27,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1678 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 06:24:27,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-11-09 06:24:27,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 544. [2024-11-09 06:24:27,243 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:24:27,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 721 transitions. [2024-11-09 06:24:27,246 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 721 transitions. Word has length 188 [2024-11-09 06:24:27,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:27,247 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 721 transitions. [2024-11-09 06:24:27,247 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:24:27,247 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 721 transitions. [2024-11-09 06:24:27,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-09 06:24:27,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:27,250 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:24:27,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:24:27,250 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:27,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:27,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1714143676, now seen corresponding path program 1 times [2024-11-09 06:24:27,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:27,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056572792] [2024-11-09 06:24:27,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:27,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:27,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 06:24:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:28,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 06:24:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:28,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 06:24:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:28,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-09 06:24:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:28,017 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:24:28,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:24:28,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056572792] [2024-11-09 06:24:28,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056572792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:24:28,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:24:28,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:24:28,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733092773] [2024-11-09 06:24:28,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:24:28,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:24:28,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:24:28,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:24:28,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:24:28,020 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:24:28,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:28,956 INFO L93 Difference]: Finished difference Result 1050 states and 1412 transitions. [2024-11-09 06:24:28,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:24:28,956 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:24:28,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:28,959 INFO L225 Difference]: With dead ends: 1050 [2024-11-09 06:24:28,959 INFO L226 Difference]: Without dead ends: 557 [2024-11-09 06:24:28,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:24:28,961 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 11 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:24:28,962 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.9s Time] [2024-11-09 06:24:28,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-09 06:24:28,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 552. [2024-11-09 06:24:28,981 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:24:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 731 transitions. [2024-11-09 06:24:28,986 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 731 transitions. Word has length 189 [2024-11-09 06:24:28,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:28,986 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 731 transitions. [2024-11-09 06:24:28,987 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:24:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 731 transitions. [2024-11-09 06:24:28,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-09 06:24:28,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:28,989 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:24:28,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:24:28,990 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:28,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:28,991 INFO L85 PathProgramCache]: Analyzing trace with hash 120248104, now seen corresponding path program 1 times [2024-11-09 06:24:28,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:28,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547026777] [2024-11-09 06:24:28,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:28,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:29,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 06:24:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:29,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 06:24:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:29,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 06:24:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:29,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-09 06:24:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:29,891 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:24:29,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:24:29,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547026777] [2024-11-09 06:24:29,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547026777] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:24:29,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524114773] [2024-11-09 06:24:29,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:29,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:24:29,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:24:29,895 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:24:29,896 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:24:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:30,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 06:24:30,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:24:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 06:24:30,670 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:24:30,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524114773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:24:30,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:24:30,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-09 06:24:30,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959213606] [2024-11-09 06:24:30,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:24:30,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:24:30,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:24:30,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:24:30,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:24:30,673 INFO L87 Difference]: Start difference. First operand 552 states and 731 transitions. Second operand has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 06:24:30,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:30,785 INFO L93 Difference]: Finished difference Result 1074 states and 1437 transitions. [2024-11-09 06:24:30,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:24:30,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 189 [2024-11-09 06:24:30,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:30,789 INFO L225 Difference]: With dead ends: 1074 [2024-11-09 06:24:30,789 INFO L226 Difference]: Without dead ends: 617 [2024-11-09 06:24:30,790 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:24:30,791 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:24:30,791 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:24:30,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-09 06:24:30,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 555. [2024-11-09 06:24:30,810 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:24:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 737 transitions. [2024-11-09 06:24:30,812 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 737 transitions. Word has length 189 [2024-11-09 06:24:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:30,813 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 737 transitions. [2024-11-09 06:24:30,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 06:24:30,813 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 737 transitions. [2024-11-09 06:24:30,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-09 06:24:30,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:30,816 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:24:30,843 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:24:31,016 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:24:31,017 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:24:31,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:31,018 INFO L85 PathProgramCache]: Analyzing trace with hash -986473756, now seen corresponding path program 1 times [2024-11-09 06:24:31,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:24:31,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920836897] [2024-11-09 06:24:31,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:31,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:24:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat