./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_label44+token_ring.09.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.09.cil-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 eebca77f45674e9c747126627d8fffbab7911c70d4e1d781272ecaec26772b5e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:18:34,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:18:34,882 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:18:34,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:18:34,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:18:34,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:18:34,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:18:34,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:18:34,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:18:34,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:18:34,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:18:34,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:18:34,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:18:34,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:18:34,921 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:18:34,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:18:34,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:18:34,922 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:18:34,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:18:34,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:18:34,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:18:34,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:18:34,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:18:34,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:18:34,928 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:18:34,928 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:18:34,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:18:34,929 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:18:34,929 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:18:34,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:18:34,930 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:18:34,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:18:34,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:18:34,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:18:34,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:18:34,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:18:34,937 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:18:34,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:18:34,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:18:34,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:18:34,939 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:18:34,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:18:34,940 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-clean/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-clean/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 -> eebca77f45674e9c747126627d8fffbab7911c70d4e1d781272ecaec26772b5e [2024-10-11 04:18:35,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:18:35,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:18:35,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:18:35,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:18:35,214 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:18:35,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.09.cil-1.c [2024-10-11 04:18:36,688 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:18:37,337 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:18:37,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.09.cil-1.c [2024-10-11 04:18:37,395 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/514db0bca/252c45358802430694ee581c4893ed28/FLAGf1d882586 [2024-10-11 04:18:37,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/514db0bca/252c45358802430694ee581c4893ed28 [2024-10-11 04:18:37,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:18:37,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:18:37,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:18:37,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:18:37,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:18:37,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:18:37" (1/1) ... [2024-10-11 04:18:37,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5366ae06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:37, skipping insertion in model container [2024-10-11 04:18:37,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:18:37" (1/1) ... [2024-10-11 04:18:37,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:18:39,273 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_label44+token_ring.09.cil-1.c[377340,377353] [2024-10-11 04:18:39,304 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_label44+token_ring.09.cil-1.c[383339,383352] [2024-10-11 04:18:39,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:18:39,579 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:18:40,338 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_label44+token_ring.09.cil-1.c[377340,377353] [2024-10-11 04:18:40,347 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_label44+token_ring.09.cil-1.c[383339,383352] [2024-10-11 04:18:40,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:18:40,441 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:18:40,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:40 WrapperNode [2024-10-11 04:18:40,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:18:40,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:18:40,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:18:40,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:18:40,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:40" (1/1) ... [2024-10-11 04:18:40,557 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:40" (1/1) ... [2024-10-11 04:18:41,034 INFO L138 Inliner]: procedures = 62, calls = 68, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 13053 [2024-10-11 04:18:41,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:18:41,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:18:41,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:18:41,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:18:41,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:40" (1/1) ... [2024-10-11 04:18:41,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:40" (1/1) ... [2024-10-11 04:18:41,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:40" (1/1) ... [2024-10-11 04:18:41,243 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-11 04:18:41,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:40" (1/1) ... [2024-10-11 04:18:41,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:40" (1/1) ... [2024-10-11 04:18:41,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:40" (1/1) ... [2024-10-11 04:18:41,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:40" (1/1) ... [2024-10-11 04:18:41,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:40" (1/1) ... [2024-10-11 04:18:41,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:40" (1/1) ... [2024-10-11 04:18:41,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:18:41,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:18:41,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:18:41,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:18:41,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:40" (1/1) ... [2024-10-11 04:18:41,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:18:41,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:18:41,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:18:41,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:18:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:18:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:18:41,849 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:18:41,850 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:18:41,854 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:18:41,855 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:18:41,855 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:18:41,855 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:18:41,855 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:18:41,855 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:18:41,856 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:18:41,856 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:18:41,856 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:18:41,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:18:41,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:18:41,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:18:42,019 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:18:42,022 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:18:49,635 INFO L? ?]: Removed 1737 outVars from TransFormulas that were not future-live. [2024-10-11 04:18:49,635 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:18:49,746 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:18:49,746 INFO L314 CfgBuilder]: Removed 13 assume(true) statements. [2024-10-11 04:18:49,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:18:49 BoogieIcfgContainer [2024-10-11 04:18:49,747 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:18:49,749 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:18:49,749 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:18:49,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:18:49,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:18:37" (1/3) ... [2024-10-11 04:18:49,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d041e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:18:49, skipping insertion in model container [2024-10-11 04:18:49,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:18:40" (2/3) ... [2024-10-11 04:18:49,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d041e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:18:49, skipping insertion in model container [2024-10-11 04:18:49,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:18:49" (3/3) ... [2024-10-11 04:18:49,755 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label44+token_ring.09.cil-1.c [2024-10-11 04:18:49,772 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:18:49,773 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:18:49,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:18:49,916 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;@4389d36f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:18:49,916 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:18:49,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 2402 states, 2370 states have (on average 1.8784810126582279) internal successors, (4452), 2373 states have internal predecessors, (4452), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 04:18:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:18:50,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:18:50,041 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:18:50,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:18:50,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:18:50,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1643509846, now seen corresponding path program 1 times [2024-10-11 04:18:50,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:18:50,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725912621] [2024-10-11 04:18:50,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:18:50,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:18:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:50,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:18:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:50,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 04:18:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:50,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 04:18:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:50,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 04:18:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:50,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:18:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:50,635 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-11 04:18:50,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:18:50,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725912621] [2024-10-11 04:18:50,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725912621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:18:50,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:18:50,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:18:50,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450147050] [2024-10-11 04:18:50,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:18:50,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:18:50,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:18:50,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:18:50,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:18:50,676 INFO L87 Difference]: Start difference. First operand has 2402 states, 2370 states have (on average 1.8784810126582279) internal successors, (4452), 2373 states have internal predecessors, (4452), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 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-11 04:18:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:18:52,336 INFO L93 Difference]: Finished difference Result 4898 states and 9162 transitions. [2024-10-11 04:18:52,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:18:52,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 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 131 [2024-10-11 04:18:52,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:18:52,368 INFO L225 Difference]: With dead ends: 4898 [2024-10-11 04:18:52,368 INFO L226 Difference]: Without dead ends: 2498 [2024-10-11 04:18:52,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:18:52,386 INFO L432 NwaCegarLoop]: 4200 mSDtfsCounter, 764 mSDsluCounter, 12138 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 16338 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:18:52,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 16338 Invalid, 886 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:18:52,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2024-10-11 04:18:52,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2398. [2024-10-11 04:18:52,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 2367 states have (on average 1.8411491339247994) internal successors, (4358), 2369 states have internal predecessors, (4358), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 04:18:52,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 4404 transitions. [2024-10-11 04:18:52,554 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 4404 transitions. Word has length 131 [2024-10-11 04:18:52,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:18:52,555 INFO L471 AbstractCegarLoop]: Abstraction has 2398 states and 4404 transitions. [2024-10-11 04:18:52,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 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-11 04:18:52,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 4404 transitions. [2024-10-11 04:18:52,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:18:52,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:18:52,561 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:18:52,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:18:52,562 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:18:52,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:18:52,563 INFO L85 PathProgramCache]: Analyzing trace with hash 406899052, now seen corresponding path program 1 times [2024-10-11 04:18:52,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:18:52,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939136433] [2024-10-11 04:18:52,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:18:52,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:18:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:52,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:18:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:52,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 04:18:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:52,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 04:18:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:52,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 04:18:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:52,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:18:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:52,962 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-11 04:18:52,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:18:52,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939136433] [2024-10-11 04:18:52,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939136433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:18:52,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:18:52,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:18:52,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662005942] [2024-10-11 04:18:52,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:18:52,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:18:52,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:18:52,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:18:52,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:18:52,969 INFO L87 Difference]: Start difference. First operand 2398 states and 4404 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 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-11 04:18:55,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:18:55,571 INFO L93 Difference]: Finished difference Result 3135 states and 5628 transitions. [2024-10-11 04:18:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:18:55,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 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 131 [2024-10-11 04:18:55,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:18:55,586 INFO L225 Difference]: With dead ends: 3135 [2024-10-11 04:18:55,587 INFO L226 Difference]: Without dead ends: 2873 [2024-10-11 04:18:55,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:18:55,591 INFO L432 NwaCegarLoop]: 4171 mSDtfsCounter, 5107 mSDsluCounter, 12498 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5123 SdHoareTripleChecker+Valid, 16669 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:18:55,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5123 Valid, 16669 Invalid, 1887 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [96 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 04:18:55,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2024-10-11 04:18:55,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2674. [2024-10-11 04:18:55,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2618 states have (on average 1.8216195569136746) internal successors, (4769), 2621 states have internal predecessors, (4769), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2024-10-11 04:18:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 4854 transitions. [2024-10-11 04:18:55,699 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 4854 transitions. Word has length 131 [2024-10-11 04:18:55,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:18:55,700 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 4854 transitions. [2024-10-11 04:18:55,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 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-11 04:18:55,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 4854 transitions. [2024-10-11 04:18:55,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:18:55,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:18:55,703 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:18:55,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:18:55,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:18:55,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:18:55,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1501391760, now seen corresponding path program 1 times [2024-10-11 04:18:55,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:18:55,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080954439] [2024-10-11 04:18:55,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:18:55,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:18:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:55,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:18:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:55,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 04:18:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:56,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 04:18:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:56,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 04:18:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:56,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:18:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:56,057 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-11 04:18:56,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:18:56,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080954439] [2024-10-11 04:18:56,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080954439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:18:56,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:18:56,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:18:56,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632439737] [2024-10-11 04:18:56,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:18:56,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:18:56,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:18:56,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:18:56,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:18:56,061 INFO L87 Difference]: Start difference. First operand 2674 states and 4854 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:18:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:18:59,351 INFO L93 Difference]: Finished difference Result 3800 states and 6722 transitions. [2024-10-11 04:18:59,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:18:59,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-11 04:18:59,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:18:59,367 INFO L225 Difference]: With dead ends: 3800 [2024-10-11 04:18:59,368 INFO L226 Difference]: Without dead ends: 3262 [2024-10-11 04:18:59,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:18:59,375 INFO L432 NwaCegarLoop]: 4330 mSDtfsCounter, 5140 mSDsluCounter, 17046 mSDsCounter, 0 mSdLazyCounter, 2910 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5156 SdHoareTripleChecker+Valid, 21376 SdHoareTripleChecker+Invalid, 2965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:18:59,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5156 Valid, 21376 Invalid, 2965 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [55 Valid, 2910 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 04:18:59,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2024-10-11 04:18:59,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 2929. [2024-10-11 04:18:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2848 states have (on average 1.8040730337078652) internal successors, (5138), 2852 states have internal predecessors, (5138), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-11 04:18:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 5261 transitions. [2024-10-11 04:18:59,552 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 5261 transitions. Word has length 131 [2024-10-11 04:18:59,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:18:59,553 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 5261 transitions. [2024-10-11 04:18:59,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:18:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 5261 transitions. [2024-10-11 04:18:59,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:18:59,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:18:59,556 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:18:59,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:18:59,556 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:18:59,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:18:59,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1030035410, now seen corresponding path program 1 times [2024-10-11 04:18:59,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:18:59,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745529474] [2024-10-11 04:18:59,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:18:59,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:18:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:59,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:18:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:59,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 04:18:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:59,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 04:18:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:59,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 04:18:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:18:59,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:18:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:00,003 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-11 04:19:00,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:00,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745529474] [2024-10-11 04:19:00,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745529474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:00,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:00,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:00,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71518649] [2024-10-11 04:19:00,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:00,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:00,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:00,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:00,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:00,006 INFO L87 Difference]: Start difference. First operand 2929 states and 5261 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:01,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:01,437 INFO L93 Difference]: Finished difference Result 4067 states and 7159 transitions. [2024-10-11 04:19:01,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:19:01,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-11 04:19:01,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:01,453 INFO L225 Difference]: With dead ends: 4067 [2024-10-11 04:19:01,454 INFO L226 Difference]: Without dead ends: 3274 [2024-10-11 04:19:01,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:19:01,459 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4804 mSDsluCounter, 16442 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4821 SdHoareTripleChecker+Valid, 20600 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:01,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4821 Valid, 20600 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:19:01,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2024-10-11 04:19:01,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 2929. [2024-10-11 04:19:01,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2848 states have (on average 1.8030196629213484) internal successors, (5135), 2852 states have internal predecessors, (5135), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-11 04:19:01,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 5258 transitions. [2024-10-11 04:19:01,566 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 5258 transitions. Word has length 131 [2024-10-11 04:19:01,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:01,566 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 5258 transitions. [2024-10-11 04:19:01,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:01,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 5258 transitions. [2024-10-11 04:19:01,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:19:01,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:01,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:19:01,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:19:01,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:01,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:01,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1133581164, now seen corresponding path program 1 times [2024-10-11 04:19:01,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:01,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759008112] [2024-10-11 04:19:01,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:01,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:01,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:01,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 04:19:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:01,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 04:19:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:01,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 04:19:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:01,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:19:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:01,803 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-11 04:19:01,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:01,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759008112] [2024-10-11 04:19:01,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759008112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:01,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:01,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:01,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892549999] [2024-10-11 04:19:01,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:01,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:01,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:01,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:01,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:01,810 INFO L87 Difference]: Start difference. First operand 2929 states and 5258 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:03,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:03,384 INFO L93 Difference]: Finished difference Result 4063 states and 7142 transitions. [2024-10-11 04:19:03,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:19:03,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-11 04:19:03,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:03,399 INFO L225 Difference]: With dead ends: 4063 [2024-10-11 04:19:03,400 INFO L226 Difference]: Without dead ends: 3270 [2024-10-11 04:19:03,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:19:03,405 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4802 mSDsluCounter, 16442 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4819 SdHoareTripleChecker+Valid, 20600 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:03,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4819 Valid, 20600 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1468 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:19:03,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2024-10-11 04:19:03,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 2929. [2024-10-11 04:19:03,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2848 states have (on average 1.8019662921348314) internal successors, (5132), 2852 states have internal predecessors, (5132), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-11 04:19:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 5255 transitions. [2024-10-11 04:19:03,503 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 5255 transitions. Word has length 131 [2024-10-11 04:19:03,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:03,503 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 5255 transitions. [2024-10-11 04:19:03,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 5255 transitions. [2024-10-11 04:19:03,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:19:03,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:03,506 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:19:03,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:19:03,506 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:03,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:03,507 INFO L85 PathProgramCache]: Analyzing trace with hash 94996590, now seen corresponding path program 1 times [2024-10-11 04:19:03,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:03,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581484285] [2024-10-11 04:19:03,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:03,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:03,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:03,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 04:19:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:03,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 04:19:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:03,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 04:19:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:03,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:19:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:03,724 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-11 04:19:03,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:03,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581484285] [2024-10-11 04:19:03,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581484285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:03,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:03,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:03,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203107217] [2024-10-11 04:19:03,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:03,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:03,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:03,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:03,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:03,727 INFO L87 Difference]: Start difference. First operand 2929 states and 5255 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:04,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:04,926 INFO L93 Difference]: Finished difference Result 4059 states and 7125 transitions. [2024-10-11 04:19:04,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:19:04,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-11 04:19:04,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:04,941 INFO L225 Difference]: With dead ends: 4059 [2024-10-11 04:19:04,942 INFO L226 Difference]: Without dead ends: 3266 [2024-10-11 04:19:04,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:19:04,947 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4919 mSDsluCounter, 12355 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4936 SdHoareTripleChecker+Valid, 16513 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:04,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4936 Valid, 16513 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:19:04,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2024-10-11 04:19:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 2929. [2024-10-11 04:19:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2848 states have (on average 1.8009129213483146) internal successors, (5129), 2852 states have internal predecessors, (5129), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-11 04:19:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 5252 transitions. [2024-10-11 04:19:05,050 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 5252 transitions. Word has length 131 [2024-10-11 04:19:05,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:05,050 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 5252 transitions. [2024-10-11 04:19:05,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:05,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 5252 transitions. [2024-10-11 04:19:05,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:19:05,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:05,053 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:19:05,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:19:05,054 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:05,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:05,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1878168788, now seen corresponding path program 1 times [2024-10-11 04:19:05,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:05,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783771090] [2024-10-11 04:19:05,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:05,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:05,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:05,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 04:19:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:05,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 04:19:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:05,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 04:19:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:05,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:19:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:05,274 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-11 04:19:05,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:05,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783771090] [2024-10-11 04:19:05,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783771090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:05,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:05,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:05,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298362455] [2024-10-11 04:19:05,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:05,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:05,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:05,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:05,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:05,277 INFO L87 Difference]: Start difference. First operand 2929 states and 5252 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:07,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:07,541 INFO L93 Difference]: Finished difference Result 4761 states and 8249 transitions. [2024-10-11 04:19:07,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:19:07,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-11 04:19:07,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:07,561 INFO L225 Difference]: With dead ends: 4761 [2024-10-11 04:19:07,562 INFO L226 Difference]: Without dead ends: 3968 [2024-10-11 04:19:07,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:19:07,568 INFO L432 NwaCegarLoop]: 4180 mSDtfsCounter, 5191 mSDsluCounter, 16647 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5207 SdHoareTripleChecker+Valid, 20827 SdHoareTripleChecker+Invalid, 2439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:07,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5207 Valid, 20827 Invalid, 2439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:19:07,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2024-10-11 04:19:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3452. [2024-10-11 04:19:07,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3321 states have (on average 1.7705510388437218) internal successors, (5880), 3327 states have internal predecessors, (5880), 95 states have call successors, (95), 30 states have call predecessors, (95), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-10-11 04:19:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 6083 transitions. [2024-10-11 04:19:07,710 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 6083 transitions. Word has length 131 [2024-10-11 04:19:07,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:07,712 INFO L471 AbstractCegarLoop]: Abstraction has 3452 states and 6083 transitions. [2024-10-11 04:19:07,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:07,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 6083 transitions. [2024-10-11 04:19:07,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:19:07,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:07,716 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:19:07,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:19:07,716 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:07,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:07,716 INFO L85 PathProgramCache]: Analyzing trace with hash 274938030, now seen corresponding path program 1 times [2024-10-11 04:19:07,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:07,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151572225] [2024-10-11 04:19:07,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:07,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:07,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:07,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 04:19:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:07,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 04:19:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:07,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 04:19:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:07,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:19:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:07,924 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-11 04:19:07,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:07,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151572225] [2024-10-11 04:19:07,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151572225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:07,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:07,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:07,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055755108] [2024-10-11 04:19:07,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:07,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:07,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:07,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:07,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:07,927 INFO L87 Difference]: Start difference. First operand 3452 states and 6083 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:09,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:09,265 INFO L93 Difference]: Finished difference Result 5271 states and 9068 transitions. [2024-10-11 04:19:09,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:19:09,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-11 04:19:09,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:09,291 INFO L225 Difference]: With dead ends: 5271 [2024-10-11 04:19:09,293 INFO L226 Difference]: Without dead ends: 3955 [2024-10-11 04:19:09,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:19:09,300 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4918 mSDsluCounter, 12355 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4935 SdHoareTripleChecker+Valid, 16513 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:09,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4935 Valid, 16513 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:19:09,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2024-10-11 04:19:09,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 3452. [2024-10-11 04:19:09,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3321 states have (on average 1.7690454682324601) internal successors, (5875), 3327 states have internal predecessors, (5875), 95 states have call successors, (95), 30 states have call predecessors, (95), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-10-11 04:19:09,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 6078 transitions. [2024-10-11 04:19:09,434 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 6078 transitions. Word has length 131 [2024-10-11 04:19:09,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:09,434 INFO L471 AbstractCegarLoop]: Abstraction has 3452 states and 6078 transitions. [2024-10-11 04:19:09,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:09,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 6078 transitions. [2024-10-11 04:19:09,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:19:09,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:09,438 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:19:09,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:19:09,438 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:09,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:09,439 INFO L85 PathProgramCache]: Analyzing trace with hash -348343572, now seen corresponding path program 1 times [2024-10-11 04:19:09,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:09,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473887296] [2024-10-11 04:19:09,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:09,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:09,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:09,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 04:19:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:09,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 04:19:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:09,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 04:19:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:09,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:19:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:09,676 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-11 04:19:09,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:09,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473887296] [2024-10-11 04:19:09,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473887296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:09,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:09,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:09,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534202026] [2024-10-11 04:19:09,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:09,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:09,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:09,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:09,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:09,680 INFO L87 Difference]: Start difference. First operand 3452 states and 6078 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:12,542 INFO L93 Difference]: Finished difference Result 6630 states and 11232 transitions. [2024-10-11 04:19:12,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:19:12,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-11 04:19:12,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:12,560 INFO L225 Difference]: With dead ends: 6630 [2024-10-11 04:19:12,560 INFO L226 Difference]: Without dead ends: 5314 [2024-10-11 04:19:12,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:19:12,568 INFO L432 NwaCegarLoop]: 4328 mSDtfsCounter, 5105 mSDsluCounter, 17046 mSDsCounter, 0 mSdLazyCounter, 2776 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5121 SdHoareTripleChecker+Valid, 21374 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:12,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5121 Valid, 21374 Invalid, 2833 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 2776 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 04:19:12,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2024-10-11 04:19:12,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 4498. [2024-10-11 04:19:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4498 states, 4267 states have (on average 1.7265057417389267) internal successors, (7367), 4277 states have internal predecessors, (7367), 167 states have call successors, (167), 54 states have call predecessors, (167), 62 states have return successors, (202), 174 states have call predecessors, (202), 167 states have call successors, (202) [2024-10-11 04:19:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4498 states to 4498 states and 7736 transitions. [2024-10-11 04:19:12,868 INFO L78 Accepts]: Start accepts. Automaton has 4498 states and 7736 transitions. Word has length 131 [2024-10-11 04:19:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:12,871 INFO L471 AbstractCegarLoop]: Abstraction has 4498 states and 7736 transitions. [2024-10-11 04:19:12,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand 4498 states and 7736 transitions. [2024-10-11 04:19:12,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:19:12,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:12,875 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:19:12,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:19:12,875 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:12,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:12,876 INFO L85 PathProgramCache]: Analyzing trace with hash -229902098, now seen corresponding path program 1 times [2024-10-11 04:19:12,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:12,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473556077] [2024-10-11 04:19:12,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:12,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:12,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:13,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 04:19:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:13,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 04:19:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:13,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 04:19:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:13,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:19:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:13,141 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-11 04:19:13,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:13,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473556077] [2024-10-11 04:19:13,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473556077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:13,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:13,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:13,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204594765] [2024-10-11 04:19:13,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:13,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:13,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:13,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:13,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:13,145 INFO L87 Difference]: Start difference. First operand 4498 states and 7736 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:16,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:16,069 INFO L93 Difference]: Finished difference Result 10374 states and 17252 transitions. [2024-10-11 04:19:16,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:19:16,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-11 04:19:16,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:16,098 INFO L225 Difference]: With dead ends: 10374 [2024-10-11 04:19:16,098 INFO L226 Difference]: Without dead ends: 8012 [2024-10-11 04:19:16,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:19:16,112 INFO L432 NwaCegarLoop]: 4328 mSDtfsCounter, 5110 mSDsluCounter, 17046 mSDsCounter, 0 mSdLazyCounter, 2758 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5126 SdHoareTripleChecker+Valid, 21374 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:16,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5126 Valid, 21374 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2758 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 04:19:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8012 states. [2024-10-11 04:19:16,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8012 to 6595. [2024-10-11 04:19:16,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6595 states, 6164 states have (on average 1.6802401038286827) internal successors, (10357), 6182 states have internal predecessors, (10357), 311 states have call successors, (311), 102 states have call predecessors, (311), 118 states have return successors, (408), 326 states have call predecessors, (408), 311 states have call successors, (408) [2024-10-11 04:19:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6595 states to 6595 states and 11076 transitions. [2024-10-11 04:19:16,583 INFO L78 Accepts]: Start accepts. Automaton has 6595 states and 11076 transitions. Word has length 131 [2024-10-11 04:19:16,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:16,584 INFO L471 AbstractCegarLoop]: Abstraction has 6595 states and 11076 transitions. [2024-10-11 04:19:16,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:16,584 INFO L276 IsEmpty]: Start isEmpty. Operand 6595 states and 11076 transitions. [2024-10-11 04:19:16,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:19:16,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:16,589 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:19:16,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:19:16,589 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:16,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:16,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1159391916, now seen corresponding path program 1 times [2024-10-11 04:19:16,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:16,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776096075] [2024-10-11 04:19:16,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:16,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:16,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:16,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 04:19:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:16,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 04:19:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:16,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 04:19:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:16,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:19:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:16,794 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-11 04:19:16,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:16,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776096075] [2024-10-11 04:19:16,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776096075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:16,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:16,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:16,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132729713] [2024-10-11 04:19:16,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:16,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:16,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:16,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:16,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:16,797 INFO L87 Difference]: Start difference. First operand 6595 states and 11076 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:20,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:20,524 INFO L93 Difference]: Finished difference Result 19523 states and 32052 transitions. [2024-10-11 04:19:20,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:19:20,524 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-11 04:19:20,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:20,574 INFO L225 Difference]: With dead ends: 19523 [2024-10-11 04:19:20,574 INFO L226 Difference]: Without dead ends: 15064 [2024-10-11 04:19:20,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:19:20,593 INFO L432 NwaCegarLoop]: 4325 mSDtfsCounter, 5178 mSDsluCounter, 17038 mSDsCounter, 0 mSdLazyCounter, 3229 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5193 SdHoareTripleChecker+Valid, 21363 SdHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:20,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5193 Valid, 21363 Invalid, 3288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3229 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 04:19:20,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15064 states. [2024-10-11 04:19:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15064 to 10709. [2024-10-11 04:19:21,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10709 states, 9894 states have (on average 1.6423084697796644) internal successors, (16249), 9928 states have internal predecessors, (16249), 583 states have call successors, (583), 198 states have call predecessors, (583), 230 states have return successors, (858), 614 states have call predecessors, (858), 583 states have call successors, (858) [2024-10-11 04:19:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10709 states to 10709 states and 17690 transitions. [2024-10-11 04:19:21,175 INFO L78 Accepts]: Start accepts. Automaton has 10709 states and 17690 transitions. Word has length 131 [2024-10-11 04:19:21,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:21,176 INFO L471 AbstractCegarLoop]: Abstraction has 10709 states and 17690 transitions. [2024-10-11 04:19:21,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 10709 states and 17690 transitions. [2024-10-11 04:19:21,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:19:21,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:21,183 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:19:21,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:19:21,184 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:21,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:21,184 INFO L85 PathProgramCache]: Analyzing trace with hash -707316758, now seen corresponding path program 1 times [2024-10-11 04:19:21,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:21,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448780014] [2024-10-11 04:19:21,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:21,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:21,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:21,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 04:19:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:21,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 04:19:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:21,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 04:19:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:21,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:19:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:21,386 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-11 04:19:21,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:21,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448780014] [2024-10-11 04:19:21,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448780014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:21,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:21,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:21,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944945294] [2024-10-11 04:19:21,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:21,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:21,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:21,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:21,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:21,387 INFO L87 Difference]: Start difference. First operand 10709 states and 17690 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:25,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:25,084 INFO L93 Difference]: Finished difference Result 35491 states and 58044 transitions. [2024-10-11 04:19:25,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:19:25,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-11 04:19:25,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:25,208 INFO L225 Difference]: With dead ends: 35491 [2024-10-11 04:19:25,208 INFO L226 Difference]: Without dead ends: 26918 [2024-10-11 04:19:25,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:19:25,252 INFO L432 NwaCegarLoop]: 4326 mSDtfsCounter, 5363 mSDsluCounter, 17041 mSDsCounter, 0 mSdLazyCounter, 2708 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5389 SdHoareTripleChecker+Valid, 21367 SdHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:25,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5389 Valid, 21367 Invalid, 2768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2708 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 04:19:25,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26918 states. [2024-10-11 04:19:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26918 to 19014. [2024-10-11 04:19:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19014 states, 17447 states have (on average 1.6155786095030664) internal successors, (28187), 17513 states have internal predecessors, (28187), 1111 states have call successors, (1111), 390 states have call predecessors, (1111), 454 states have return successors, (1904), 1174 states have call predecessors, (1904), 1111 states have call successors, (1904) [2024-10-11 04:19:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19014 states to 19014 states and 31202 transitions. [2024-10-11 04:19:26,735 INFO L78 Accepts]: Start accepts. Automaton has 19014 states and 31202 transitions. Word has length 131 [2024-10-11 04:19:26,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:26,736 INFO L471 AbstractCegarLoop]: Abstraction has 19014 states and 31202 transitions. [2024-10-11 04:19:26,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 19014 states and 31202 transitions. [2024-10-11 04:19:26,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:19:26,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:26,748 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:19:26,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:19:26,749 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:26,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:26,749 INFO L85 PathProgramCache]: Analyzing trace with hash -2014459156, now seen corresponding path program 1 times [2024-10-11 04:19:26,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:26,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064084771] [2024-10-11 04:19:26,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:26,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:26,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:26,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 04:19:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:26,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 04:19:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:26,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 04:19:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:26,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:19:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:26,948 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-11 04:19:26,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:26,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064084771] [2024-10-11 04:19:26,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064084771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:26,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:26,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:26,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124193529] [2024-10-11 04:19:26,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:26,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:26,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:26,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:26,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:26,951 INFO L87 Difference]: Start difference. First operand 19014 states and 31202 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:32,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:32,037 INFO L93 Difference]: Finished difference Result 67154 states and 110194 transitions. [2024-10-11 04:19:32,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:19:32,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-11 04:19:32,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:32,270 INFO L225 Difference]: With dead ends: 67154 [2024-10-11 04:19:32,270 INFO L226 Difference]: Without dead ends: 50276 [2024-10-11 04:19:32,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:19:32,341 INFO L432 NwaCegarLoop]: 4326 mSDtfsCounter, 5327 mSDsluCounter, 17041 mSDsCounter, 0 mSdLazyCounter, 2695 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5353 SdHoareTripleChecker+Valid, 21367 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:32,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5353 Valid, 21367 Invalid, 2755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2695 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 04:19:32,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50276 states. [2024-10-11 04:19:34,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50276 to 35623. [2024-10-11 04:19:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35623 states, 32584 states have (on average 1.599711514853916) internal successors, (52125), 32714 states have internal predecessors, (52125), 2135 states have call successors, (2135), 774 states have call predecessors, (2135), 902 states have return successors, (4450), 2262 states have call predecessors, (4450), 2135 states have call successors, (4450) [2024-10-11 04:19:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35623 states to 35623 states and 58710 transitions. [2024-10-11 04:19:35,149 INFO L78 Accepts]: Start accepts. Automaton has 35623 states and 58710 transitions. Word has length 131 [2024-10-11 04:19:35,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:19:35,151 INFO L471 AbstractCegarLoop]: Abstraction has 35623 states and 58710 transitions. [2024-10-11 04:19:35,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:35,151 INFO L276 IsEmpty]: Start isEmpty. Operand 35623 states and 58710 transitions. [2024-10-11 04:19:35,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 04:19:35,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:19:35,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 04:19:35,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:19:35,176 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:19:35,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:19:35,176 INFO L85 PathProgramCache]: Analyzing trace with hash -116962390, now seen corresponding path program 1 times [2024-10-11 04:19:35,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:19:35,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873991138] [2024-10-11 04:19:35,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:19:35,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:19:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:35,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:19:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:35,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 04:19:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:35,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 04:19:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:35,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 04:19:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:35,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 04:19:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:19:35,372 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-11 04:19:35,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:19:35,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873991138] [2024-10-11 04:19:35,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873991138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:19:35,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:19:35,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:19:35,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665093598] [2024-10-11 04:19:35,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:19:35,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:19:35,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:19:35,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:19:35,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:19:35,374 INFO L87 Difference]: Start difference. First operand 35623 states and 58710 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-11 04:19:43,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:19:43,451 INFO L93 Difference]: Finished difference Result 129521 states and 214776 transitions. [2024-10-11 04:19:43,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:19:43,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-11 04:19:43,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:19:44,100 INFO L225 Difference]: With dead ends: 129521 [2024-10-11 04:19:44,101 INFO L226 Difference]: Without dead ends: 96034 [2024-10-11 04:19:44,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:19:44,211 INFO L432 NwaCegarLoop]: 4182 mSDtfsCounter, 5211 mSDsluCounter, 16645 mSDsCounter, 0 mSdLazyCounter, 2647 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5226 SdHoareTripleChecker+Valid, 20827 SdHoareTripleChecker+Invalid, 2734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:19:44,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5226 Valid, 20827 Invalid, 2734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2647 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 04:19:44,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96034 states.