./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c -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 9e8eec1743df688e821561fda517f1945d9b8e3e5029879578d4191f60280f1b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:53:58,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:53:59,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:53:59,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:53:59,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:53:59,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:53:59,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:53:59,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:53:59,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:53:59,048 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:53:59,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:53:59,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:53:59,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:53:59,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:53:59,049 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:53:59,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:53:59,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:53:59,051 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:53:59,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:53:59,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:53:59,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:53:59,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:53:59,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:53:59,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:53:59,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:53:59,053 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:53:59,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:53:59,054 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:53:59,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:53:59,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:53:59,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:53:59,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:53:59,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:53:59,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:53:59,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:53:59,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:53:59,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:53:59,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:53:59,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:53:59,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:53:59,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:53:59,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:53:59,059 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 -> 9e8eec1743df688e821561fda517f1945d9b8e3e5029879578d4191f60280f1b [2024-10-12 20:53:59,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:53:59,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:53:59,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:53:59,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:53:59,290 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:53:59,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c [2024-10-12 20:54:00,644 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:54:01,092 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:54:01,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c [2024-10-12 20:54:01,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31924fa68/bcda6db29d7a44c3bd7e0fee6ba26dab/FLAGb9f0436af [2024-10-12 20:54:01,147 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31924fa68/bcda6db29d7a44c3bd7e0fee6ba26dab [2024-10-12 20:54:01,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:54:01,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:54:01,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:54:01,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:54:01,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:54:01,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:54:01" (1/1) ... [2024-10-12 20:54:01,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@735506ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:01, skipping insertion in model container [2024-10-12 20:54:01,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:54:01" (1/1) ... [2024-10-12 20:54:01,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:54:03,004 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c[378560,378573] [2024-10-12 20:54:03,030 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c[383339,383352] [2024-10-12 20:54:03,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:54:03,171 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:54:03,840 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c[378560,378573] [2024-10-12 20:54:03,856 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c[383339,383352] [2024-10-12 20:54:03,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:54:03,921 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:54:03,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:03 WrapperNode [2024-10-12 20:54:03,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:54:03,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:54:03,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:54:03,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:54:03,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:03" (1/1) ... [2024-10-12 20:54:03,993 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:03" (1/1) ... [2024-10-12 20:54:04,500 INFO L138 Inliner]: procedures = 52, calls = 53, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 12753 [2024-10-12 20:54:04,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:54:04,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:54:04,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:54:04,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:54:04,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:03" (1/1) ... [2024-10-12 20:54:04,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:03" (1/1) ... [2024-10-12 20:54:04,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:03" (1/1) ... [2024-10-12 20:54:04,634 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 20:54:04,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:03" (1/1) ... [2024-10-12 20:54:04,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:03" (1/1) ... [2024-10-12 20:54:04,865 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:03" (1/1) ... [2024-10-12 20:54:04,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:03" (1/1) ... [2024-10-12 20:54:04,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:03" (1/1) ... [2024-10-12 20:54:05,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:03" (1/1) ... [2024-10-12 20:54:05,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:54:05,155 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:54:05,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:54:05,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:54:05,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:03" (1/1) ... [2024-10-12 20:54:05,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:54:05,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:54:05,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:54:05,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:54:05,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:54:05,298 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 20:54:05,298 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 20:54:05,298 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 20:54:05,303 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 20:54:05,304 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 20:54:05,304 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 20:54:05,304 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 20:54:05,304 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 20:54:05,305 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 20:54:05,305 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 20:54:05,305 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 20:54:05,305 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 20:54:05,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:54:05,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:54:05,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:54:05,478 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:54:05,487 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:54:11,665 INFO L? ?]: Removed 1707 outVars from TransFormulas that were not future-live. [2024-10-12 20:54:11,666 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:54:11,770 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:54:11,771 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-12 20:54:11,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:54:11 BoogieIcfgContainer [2024-10-12 20:54:11,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:54:11,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:54:11,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:54:11,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:54:11,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:54:01" (1/3) ... [2024-10-12 20:54:11,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf24d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:54:11, skipping insertion in model container [2024-10-12 20:54:11,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:03" (2/3) ... [2024-10-12 20:54:11,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf24d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:54:11, skipping insertion in model container [2024-10-12 20:54:11,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:54:11" (3/3) ... [2024-10-12 20:54:11,782 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.04.cil-1.c [2024-10-12 20:54:11,796 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:54:11,797 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 20:54:11,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:54:11,914 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;@695a1375, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:54:11,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 20:54:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 2287 states, 2260 states have (on average 1.8836283185840708) internal successors, (4257), 2263 states have internal predecessors, (4257), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-12 20:54:11,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:54:11,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:11,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:54:11,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:11,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:11,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1377940007, now seen corresponding path program 1 times [2024-10-12 20:54:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:11,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787967828] [2024-10-12 20:54:11,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:11,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:54:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:54:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 20:54:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 20:54:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:12,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:54:12,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:12,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787967828] [2024-10-12 20:54:12,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787967828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:12,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:12,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:54:12,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488624959] [2024-10-12 20:54:12,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:12,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:54:12,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:12,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:54:12,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:54:12,367 INFO L87 Difference]: Start difference. First operand has 2287 states, 2260 states have (on average 1.8836283185840708) internal successors, (4257), 2263 states have internal predecessors, (4257), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:13,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:13,436 INFO L93 Difference]: Finished difference Result 4620 states and 8666 transitions. [2024-10-12 20:54:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:54:13,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 20:54:13,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:13,489 INFO L225 Difference]: With dead ends: 4620 [2024-10-12 20:54:13,489 INFO L226 Difference]: Without dead ends: 2333 [2024-10-12 20:54:13,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:54:13,514 INFO L432 NwaCegarLoop]: 4105 mSDtfsCounter, 411 mSDsluCounter, 12028 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 16133 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:13,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 16133 Invalid, 486 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [40 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:54:13,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2024-10-12 20:54:13,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 2283. [2024-10-12 20:54:13,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2283 states, 2257 states have (on average 1.8489144882587505) internal successors, (4173), 2259 states have internal predecessors, (4173), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-12 20:54:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 4209 transitions. [2024-10-12 20:54:13,682 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 4209 transitions. Word has length 81 [2024-10-12 20:54:13,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:13,682 INFO L471 AbstractCegarLoop]: Abstraction has 2283 states and 4209 transitions. [2024-10-12 20:54:13,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:13,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 4209 transitions. [2024-10-12 20:54:13,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:54:13,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:13,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:54:13,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:54:13,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:13,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:13,693 INFO L85 PathProgramCache]: Analyzing trace with hash 490717161, now seen corresponding path program 1 times [2024-10-12 20:54:13,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:13,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600906216] [2024-10-12 20:54:13,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:13,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:13,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:13,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:54:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:13,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:54:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:13,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 20:54:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:13,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 20:54:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:54:13,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:13,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600906216] [2024-10-12 20:54:13,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600906216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:13,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:13,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:54:13,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919012066] [2024-10-12 20:54:13,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:13,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:54:13,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:13,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:54:13,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:54:13,941 INFO L87 Difference]: Start difference. First operand 2283 states and 4209 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:14,955 INFO L93 Difference]: Finished difference Result 2690 states and 4863 transitions. [2024-10-12 20:54:14,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:54:14,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 20:54:14,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:14,963 INFO L225 Difference]: With dead ends: 2690 [2024-10-12 20:54:14,963 INFO L226 Difference]: Without dead ends: 2538 [2024-10-12 20:54:14,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:54:14,965 INFO L432 NwaCegarLoop]: 4086 mSDtfsCounter, 4562 mSDsluCounter, 12233 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4573 SdHoareTripleChecker+Valid, 16319 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:14,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4573 Valid, 16319 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 20:54:14,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2024-10-12 20:54:15,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2439. [2024-10-12 20:54:15,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2439 states, 2393 states have (on average 1.8340994567488509) internal successors, (4389), 2396 states have internal predecessors, (4389), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (34), 31 states have call predecessors, (34), 31 states have call successors, (34) [2024-10-12 20:54:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 2439 states and 4454 transitions. [2024-10-12 20:54:15,016 INFO L78 Accepts]: Start accepts. Automaton has 2439 states and 4454 transitions. Word has length 81 [2024-10-12 20:54:15,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:15,016 INFO L471 AbstractCegarLoop]: Abstraction has 2439 states and 4454 transitions. [2024-10-12 20:54:15,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:15,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 4454 transitions. [2024-10-12 20:54:15,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:54:15,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:15,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:54:15,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:54:15,018 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:15,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:15,019 INFO L85 PathProgramCache]: Analyzing trace with hash -927081943, now seen corresponding path program 1 times [2024-10-12 20:54:15,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:15,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763294451] [2024-10-12 20:54:15,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:15,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:15,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:15,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:54:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:15,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:54:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:15,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 20:54:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:15,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 20:54:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:54:15,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:15,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763294451] [2024-10-12 20:54:15,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763294451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:15,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:15,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:54:15,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056680340] [2024-10-12 20:54:15,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:15,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:54:15,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:15,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:54:15,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:15,173 INFO L87 Difference]: Start difference. First operand 2439 states and 4454 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:16,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:16,634 INFO L93 Difference]: Finished difference Result 3055 states and 5437 transitions. [2024-10-12 20:54:16,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:54:16,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 20:54:16,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:16,644 INFO L225 Difference]: With dead ends: 3055 [2024-10-12 20:54:16,645 INFO L226 Difference]: Without dead ends: 2747 [2024-10-12 20:54:16,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:54:16,648 INFO L432 NwaCegarLoop]: 4180 mSDtfsCounter, 4567 mSDsluCounter, 16521 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4578 SdHoareTripleChecker+Valid, 20701 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:16,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4578 Valid, 20701 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 20:54:16,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2024-10-12 20:54:16,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2584. [2024-10-12 20:54:16,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2584 states, 2518 states have (on average 1.8200953137410643) internal successors, (4583), 2522 states have internal predecessors, (4583), 44 states have call successors, (44), 18 states have call predecessors, (44), 20 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-10-12 20:54:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2584 states and 4676 transitions. [2024-10-12 20:54:16,772 INFO L78 Accepts]: Start accepts. Automaton has 2584 states and 4676 transitions. Word has length 81 [2024-10-12 20:54:16,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:16,773 INFO L471 AbstractCegarLoop]: Abstraction has 2584 states and 4676 transitions. [2024-10-12 20:54:16,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:16,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2584 states and 4676 transitions. [2024-10-12 20:54:16,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:54:16,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:16,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:54:16,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:54:16,774 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:16,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:16,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2143235669, now seen corresponding path program 1 times [2024-10-12 20:54:16,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:16,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461190258] [2024-10-12 20:54:16,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:16,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:16,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:16,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:54:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:16,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:54:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:16,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 20:54:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:16,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 20:54:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:54:16,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:16,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461190258] [2024-10-12 20:54:16,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461190258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:16,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:16,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:54:16,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733822613] [2024-10-12 20:54:16,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:16,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:54:16,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:16,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:54:16,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:16,892 INFO L87 Difference]: Start difference. First operand 2584 states and 4676 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:18,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:18,183 INFO L93 Difference]: Finished difference Result 3589 states and 6275 transitions. [2024-10-12 20:54:18,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:54:18,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 20:54:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:18,197 INFO L225 Difference]: With dead ends: 3589 [2024-10-12 20:54:18,197 INFO L226 Difference]: Without dead ends: 3136 [2024-10-12 20:54:18,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:54:18,200 INFO L432 NwaCegarLoop]: 4095 mSDtfsCounter, 4613 mSDsluCounter, 16302 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4624 SdHoareTripleChecker+Valid, 20397 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:18,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4624 Valid, 20397 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:54:18,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2024-10-12 20:54:18,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 2875. [2024-10-12 20:54:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2875 states, 2769 states have (on average 1.795594077284218) internal successors, (4972), 2775 states have internal predecessors, (4972), 70 states have call successors, (70), 30 states have call predecessors, (70), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-12 20:54:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 5125 transitions. [2024-10-12 20:54:18,301 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 5125 transitions. Word has length 81 [2024-10-12 20:54:18,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:18,302 INFO L471 AbstractCegarLoop]: Abstraction has 2875 states and 5125 transitions. [2024-10-12 20:54:18,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:18,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 5125 transitions. [2024-10-12 20:54:18,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:54:18,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:18,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:54:18,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:54:18,305 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:18,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:18,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1419764201, now seen corresponding path program 1 times [2024-10-12 20:54:18,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:18,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435440533] [2024-10-12 20:54:18,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:18,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:18,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:18,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:54:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:18,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:54:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:18,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 20:54:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:18,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 20:54:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:54:18,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:18,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435440533] [2024-10-12 20:54:18,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435440533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:18,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:18,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:54:18,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828657135] [2024-10-12 20:54:18,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:18,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:54:18,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:18,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:54:18,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:18,491 INFO L87 Difference]: Start difference. First operand 2875 states and 5125 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:19,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:19,275 INFO L93 Difference]: Finished difference Result 3870 states and 6717 transitions. [2024-10-12 20:54:19,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:54:19,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 20:54:19,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:19,287 INFO L225 Difference]: With dead ends: 3870 [2024-10-12 20:54:19,287 INFO L226 Difference]: Without dead ends: 3126 [2024-10-12 20:54:19,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:54:19,291 INFO L432 NwaCegarLoop]: 4073 mSDtfsCounter, 4416 mSDsluCounter, 16172 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4428 SdHoareTripleChecker+Valid, 20245 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:19,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4428 Valid, 20245 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 20:54:19,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2024-10-12 20:54:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 2875. [2024-10-12 20:54:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2875 states, 2769 states have (on average 1.79378837125316) internal successors, (4967), 2775 states have internal predecessors, (4967), 70 states have call successors, (70), 30 states have call predecessors, (70), 34 states have return successors, (83), 73 states have call predecessors, (83), 70 states have call successors, (83) [2024-10-12 20:54:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 5120 transitions. [2024-10-12 20:54:19,401 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 5120 transitions. Word has length 81 [2024-10-12 20:54:19,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:19,402 INFO L471 AbstractCegarLoop]: Abstraction has 2875 states and 5120 transitions. [2024-10-12 20:54:19,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 5120 transitions. [2024-10-12 20:54:19,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:54:19,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:19,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:54:19,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:54:19,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:19,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:19,406 INFO L85 PathProgramCache]: Analyzing trace with hash -266415637, now seen corresponding path program 1 times [2024-10-12 20:54:19,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:19,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431659742] [2024-10-12 20:54:19,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:19,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:19,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:19,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:54:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:19,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:54:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:19,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 20:54:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:19,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 20:54:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:54:19,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:19,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431659742] [2024-10-12 20:54:19,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431659742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:19,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:19,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:54:19,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26571873] [2024-10-12 20:54:19,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:19,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:54:19,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:19,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:54:19,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:19,609 INFO L87 Difference]: Start difference. First operand 2875 states and 5120 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:20,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:20,967 INFO L93 Difference]: Finished difference Result 4829 states and 8192 transitions. [2024-10-12 20:54:20,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:54:20,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 20:54:20,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:20,980 INFO L225 Difference]: With dead ends: 4829 [2024-10-12 20:54:20,981 INFO L226 Difference]: Without dead ends: 4085 [2024-10-12 20:54:20,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:54:20,985 INFO L432 NwaCegarLoop]: 4176 mSDtfsCounter, 4711 mSDsluCounter, 16516 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4727 SdHoareTripleChecker+Valid, 20692 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:20,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4727 Valid, 20692 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 20:54:20,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4085 states. [2024-10-12 20:54:21,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4085 to 3459. [2024-10-12 20:54:21,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3277 states have (on average 1.7552639609398841) internal successors, (5752), 3287 states have internal predecessors, (5752), 118 states have call successors, (118), 54 states have call predecessors, (118), 62 states have return successors, (153), 125 states have call predecessors, (153), 118 states have call successors, (153) [2024-10-12 20:54:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 6023 transitions. [2024-10-12 20:54:21,077 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 6023 transitions. Word has length 81 [2024-10-12 20:54:21,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:21,077 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 6023 transitions. [2024-10-12 20:54:21,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 6023 transitions. [2024-10-12 20:54:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:54:21,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:21,079 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:54:21,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:54:21,079 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:21,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:21,080 INFO L85 PathProgramCache]: Analyzing trace with hash -683812243, now seen corresponding path program 1 times [2024-10-12 20:54:21,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:21,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810570219] [2024-10-12 20:54:21,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:21,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:21,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:21,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:54:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:21,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:54:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:21,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 20:54:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:21,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 20:54:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:54:21,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:21,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810570219] [2024-10-12 20:54:21,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810570219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:21,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:21,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:54:21,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107123054] [2024-10-12 20:54:21,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:21,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:54:21,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:21,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:54:21,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:21,210 INFO L87 Difference]: Start difference. First operand 3459 states and 6023 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:22,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:22,831 INFO L93 Difference]: Finished difference Result 6997 states and 11579 transitions. [2024-10-12 20:54:22,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:54:22,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 20:54:22,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:22,852 INFO L225 Difference]: With dead ends: 6997 [2024-10-12 20:54:22,852 INFO L226 Difference]: Without dead ends: 5669 [2024-10-12 20:54:22,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:54:22,858 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4584 mSDsluCounter, 16513 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4594 SdHoareTripleChecker+Valid, 20688 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:22,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4594 Valid, 20688 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:54:22,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5669 states. [2024-10-12 20:54:23,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5669 to 4582. [2024-10-12 20:54:23,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4582 states, 4252 states have (on average 1.7064910630291628) internal successors, (7256), 4270 states have internal predecessors, (7256), 210 states have call successors, (210), 102 states have call predecessors, (210), 118 states have return successors, (307), 225 states have call predecessors, (307), 210 states have call successors, (307) [2024-10-12 20:54:23,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4582 states to 4582 states and 7773 transitions. [2024-10-12 20:54:23,037 INFO L78 Accepts]: Start accepts. Automaton has 4582 states and 7773 transitions. Word has length 81 [2024-10-12 20:54:23,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:23,038 INFO L471 AbstractCegarLoop]: Abstraction has 4582 states and 7773 transitions. [2024-10-12 20:54:23,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:23,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4582 states and 7773 transitions. [2024-10-12 20:54:23,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:54:23,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:23,040 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:54:23,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:54:23,041 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:23,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:23,041 INFO L85 PathProgramCache]: Analyzing trace with hash -4539989, now seen corresponding path program 1 times [2024-10-12 20:54:23,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:23,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949467019] [2024-10-12 20:54:23,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:23,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:23,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:23,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:54:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:23,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:54:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:23,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 20:54:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:23,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 20:54:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:23,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:54:23,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:23,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949467019] [2024-10-12 20:54:23,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949467019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:23,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:23,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:54:23,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430881657] [2024-10-12 20:54:23,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:23,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:54:23,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:23,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:54:23,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:23,153 INFO L87 Difference]: Start difference. First operand 4582 states and 7773 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:24,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:24,610 INFO L93 Difference]: Finished difference Result 11098 states and 18019 transitions. [2024-10-12 20:54:24,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:54:24,611 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 20:54:24,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:24,637 INFO L225 Difference]: With dead ends: 11098 [2024-10-12 20:54:24,637 INFO L226 Difference]: Without dead ends: 8647 [2024-10-12 20:54:24,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:54:24,645 INFO L432 NwaCegarLoop]: 4176 mSDtfsCounter, 4639 mSDsluCounter, 16516 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4655 SdHoareTripleChecker+Valid, 20692 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:24,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4655 Valid, 20692 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:54:24,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8647 states. [2024-10-12 20:54:24,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8647 to 6867. [2024-10-12 20:54:24,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6867 states, 6249 states have (on average 1.6549847975676109) internal successors, (10342), 6283 states have internal predecessors, (10342), 386 states have call successors, (386), 198 states have call predecessors, (386), 230 states have return successors, (661), 417 states have call predecessors, (661), 386 states have call successors, (661) [2024-10-12 20:54:24,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6867 states to 6867 states and 11389 transitions. [2024-10-12 20:54:24,901 INFO L78 Accepts]: Start accepts. Automaton has 6867 states and 11389 transitions. Word has length 81 [2024-10-12 20:54:24,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:24,902 INFO L471 AbstractCegarLoop]: Abstraction has 6867 states and 11389 transitions. [2024-10-12 20:54:24,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:24,902 INFO L276 IsEmpty]: Start isEmpty. Operand 6867 states and 11389 transitions. [2024-10-12 20:54:24,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:54:24,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:24,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:54:24,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:54:24,908 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:24,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:24,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1957034669, now seen corresponding path program 1 times [2024-10-12 20:54:24,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:24,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465516766] [2024-10-12 20:54:24,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:24,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:24,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:54:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:25,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:54:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:25,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 20:54:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:25,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 20:54:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:54:25,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:25,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465516766] [2024-10-12 20:54:25,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465516766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:25,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:25,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:54:25,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882156565] [2024-10-12 20:54:25,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:25,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:54:25,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:25,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:54:25,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:25,018 INFO L87 Difference]: Start difference. First operand 6867 states and 11389 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:27,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:27,023 INFO L93 Difference]: Finished difference Result 19165 states and 30877 transitions. [2024-10-12 20:54:27,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:54:27,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 20:54:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:27,074 INFO L225 Difference]: With dead ends: 19165 [2024-10-12 20:54:27,075 INFO L226 Difference]: Without dead ends: 14429 [2024-10-12 20:54:27,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:54:27,097 INFO L432 NwaCegarLoop]: 4176 mSDtfsCounter, 4603 mSDsluCounter, 16516 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4619 SdHoareTripleChecker+Valid, 20692 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:27,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4619 Valid, 20692 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 20:54:27,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14429 states. [2024-10-12 20:54:27,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14429 to 11436. [2024-10-12 20:54:27,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11436 states, 10258 states have (on average 1.6127900175472802) internal successors, (16544), 10324 states have internal predecessors, (16544), 722 states have call successors, (722), 390 states have call predecessors, (722), 454 states have return successors, (1515), 785 states have call predecessors, (1515), 722 states have call successors, (1515) [2024-10-12 20:54:27,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11436 states to 11436 states and 18781 transitions. [2024-10-12 20:54:27,672 INFO L78 Accepts]: Start accepts. Automaton has 11436 states and 18781 transitions. Word has length 81 [2024-10-12 20:54:27,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:27,672 INFO L471 AbstractCegarLoop]: Abstraction has 11436 states and 18781 transitions. [2024-10-12 20:54:27,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 11436 states and 18781 transitions. [2024-10-12 20:54:27,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:54:27,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:27,679 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:54:27,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:54:27,679 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:27,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:27,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2136108693, now seen corresponding path program 1 times [2024-10-12 20:54:27,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:27,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899448222] [2024-10-12 20:54:27,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:27,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:27,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:27,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:54:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:27,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:54:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:27,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 20:54:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:27,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 20:54:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:27,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:54:27,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:27,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899448222] [2024-10-12 20:54:27,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899448222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:27,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:27,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:54:27,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328563221] [2024-10-12 20:54:27,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:27,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:54:27,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:27,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:54:27,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:27,779 INFO L87 Difference]: Start difference. First operand 11436 states and 18781 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:30,111 INFO L93 Difference]: Finished difference Result 34784 states and 56375 transitions. [2024-10-12 20:54:30,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:54:30,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 20:54:30,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:30,216 INFO L225 Difference]: With dead ends: 34784 [2024-10-12 20:54:30,217 INFO L226 Difference]: Without dead ends: 25479 [2024-10-12 20:54:30,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:54:30,254 INFO L432 NwaCegarLoop]: 4166 mSDtfsCounter, 4552 mSDsluCounter, 16504 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4562 SdHoareTripleChecker+Valid, 20670 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:30,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4562 Valid, 20670 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 20:54:30,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25479 states. [2024-10-12 20:54:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25479 to 20561. [2024-10-12 20:54:31,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20561 states, 18303 states have (on average 1.5847675244495438) internal successors, (29006), 18433 states have internal predecessors, (29006), 1358 states have call successors, (1358), 770 states have call predecessors, (1358), 898 states have return successors, (3673), 1485 states have call predecessors, (3673), 1358 states have call successors, (3673) [2024-10-12 20:54:31,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20561 states to 20561 states and 34037 transitions. [2024-10-12 20:54:31,446 INFO L78 Accepts]: Start accepts. Automaton has 20561 states and 34037 transitions. Word has length 81 [2024-10-12 20:54:31,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:31,446 INFO L471 AbstractCegarLoop]: Abstraction has 20561 states and 34037 transitions. [2024-10-12 20:54:31,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:31,447 INFO L276 IsEmpty]: Start isEmpty. Operand 20561 states and 34037 transitions. [2024-10-12 20:54:31,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 20:54:31,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:31,460 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:54:31,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:54:31,460 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:31,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:31,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1575408915, now seen corresponding path program 1 times [2024-10-12 20:54:31,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:31,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847283392] [2024-10-12 20:54:31,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:31,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:31,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:31,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:54:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:31,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:54:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:31,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 20:54:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:31,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 20:54:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:54:31,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:31,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847283392] [2024-10-12 20:54:31,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847283392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:31,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:31,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:54:31,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396127365] [2024-10-12 20:54:31,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:31,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:54:31,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:31,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:54:31,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:54:31,556 INFO L87 Difference]: Start difference. First operand 20561 states and 34037 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:35,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:35,041 INFO L93 Difference]: Finished difference Result 54256 states and 88376 transitions. [2024-10-12 20:54:35,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:54:35,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 81 [2024-10-12 20:54:35,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:35,131 INFO L225 Difference]: With dead ends: 54256 [2024-10-12 20:54:35,131 INFO L226 Difference]: Without dead ends: 35827 [2024-10-12 20:54:35,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:54:35,171 INFO L432 NwaCegarLoop]: 4213 mSDtfsCounter, 4743 mSDsluCounter, 12309 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4772 SdHoareTripleChecker+Valid, 16522 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:35,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4772 Valid, 16522 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:54:35,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35827 states. [2024-10-12 20:54:37,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35827 to 29690. [2024-10-12 20:54:37,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29690 states, 26260 states have (on average 1.562909367859863) internal successors, (41042), 26519 states have internal predecessors, (41042), 2076 states have call successors, (2076), 1160 states have call predecessors, (2076), 1352 states have return successors, (5121), 2138 states have call predecessors, (5121), 2076 states have call successors, (5121) [2024-10-12 20:54:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29690 states to 29690 states and 48239 transitions. [2024-10-12 20:54:37,438 INFO L78 Accepts]: Start accepts. Automaton has 29690 states and 48239 transitions. Word has length 81 [2024-10-12 20:54:37,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:37,439 INFO L471 AbstractCegarLoop]: Abstraction has 29690 states and 48239 transitions. [2024-10-12 20:54:37,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:54:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 29690 states and 48239 transitions. [2024-10-12 20:54:37,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 20:54:37,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:37,494 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 20:54:37,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:54:37,494 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:37,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:37,494 INFO L85 PathProgramCache]: Analyzing trace with hash -162136465, now seen corresponding path program 1 times [2024-10-12 20:54:37,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:37,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636136354] [2024-10-12 20:54:37,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:37,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:37,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:37,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:54:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:37,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:54:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:37,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 20:54:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:37,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 20:54:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:37,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 20:54:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:37,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:37,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 20:54:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 20:54:37,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:37,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636136354] [2024-10-12 20:54:37,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636136354] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:54:37,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694747469] [2024-10-12 20:54:37,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:37,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:54:37,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:54:37,631 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:54:37,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 20:54:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:37,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:54:37,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:54:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-12 20:54:37,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:54:37,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694747469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:37,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:54:37,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 20:54:37,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837837396] [2024-10-12 20:54:37,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:37,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:54:37,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:37,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:54:37,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:37,812 INFO L87 Difference]: Start difference. First operand 29690 states and 48239 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 20:54:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:40,433 INFO L93 Difference]: Finished difference Result 84209 states and 136555 transitions. [2024-10-12 20:54:40,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:54:40,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 131 [2024-10-12 20:54:40,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:40,611 INFO L225 Difference]: With dead ends: 84209 [2024-10-12 20:54:40,612 INFO L226 Difference]: Without dead ends: 56651 [2024-10-12 20:54:40,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:40,671 INFO L432 NwaCegarLoop]: 4184 mSDtfsCounter, 4157 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4157 SdHoareTripleChecker+Valid, 4391 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:40,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4157 Valid, 4391 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:54:40,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56651 states. [2024-10-12 20:54:44,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56651 to 56455. [2024-10-12 20:54:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56455 states, 49707 states have (on average 1.5459995574064016) internal successors, (76847), 50223 states have internal predecessors, (76847), 4046 states have call successors, (4046), 2316 states have call predecessors, (4046), 2700 states have return successors, (10009), 4043 states have call predecessors, (10009), 4046 states have call successors, (10009) [2024-10-12 20:54:44,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56455 states to 56455 states and 90902 transitions. [2024-10-12 20:54:44,853 INFO L78 Accepts]: Start accepts. Automaton has 56455 states and 90902 transitions. Word has length 131 [2024-10-12 20:54:44,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:44,854 INFO L471 AbstractCegarLoop]: Abstraction has 56455 states and 90902 transitions. [2024-10-12 20:54:44,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 20:54:44,854 INFO L276 IsEmpty]: Start isEmpty. Operand 56455 states and 90902 transitions. [2024-10-12 20:54:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 20:54:44,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:44,919 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 20:54:44,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 20:54:45,123 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,SelfDestructingSolverStorable11 [2024-10-12 20:54:45,124 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:45,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:45,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1117499279, now seen corresponding path program 1 times [2024-10-12 20:54:45,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:45,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607252934] [2024-10-12 20:54:45,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:45,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:45,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:45,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 20:54:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:45,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 20:54:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:45,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 20:54:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:45,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 20:54:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:45,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 20:54:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:45,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-12 20:54:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:45,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 20:54:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:45,226 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 20:54:45,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:45,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607252934] [2024-10-12 20:54:45,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607252934] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 20:54:45,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620422401] [2024-10-12 20:54:45,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:45,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 20:54:45,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:54:45,229 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 20:54:45,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 20:54:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:45,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 20:54:45,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 20:54:45,366 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 20:54:45,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 20:54:45,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620422401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:45,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 20:54:45,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-12 20:54:45,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12915374] [2024-10-12 20:54:45,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:45,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:54:45,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:45,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:54:45,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:45,371 INFO L87 Difference]: Start difference. First operand 56455 states and 90902 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 20:54:51,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:51,570 INFO L93 Difference]: Finished difference Result 163896 states and 264344 transitions. [2024-10-12 20:54:51,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:54:51,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 131 [2024-10-12 20:54:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:52,026 INFO L225 Difference]: With dead ends: 163896 [2024-10-12 20:54:52,027 INFO L226 Difference]: Without dead ends: 109573 [2024-10-12 20:54:52,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:52,148 INFO L432 NwaCegarLoop]: 4184 mSDtfsCounter, 4162 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4162 SdHoareTripleChecker+Valid, 4391 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:52,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4162 Valid, 4391 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:54:52,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109573 states.