./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_label47+token_ring.08.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_label47+token_ring.08.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 d4567c6a74ac7eac1fa65db4db5999d3a1dd022fa97829ecd98c8e766f1d922f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:24:31,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:24:31,616 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:24:31,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:24:31,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:24:31,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:24:31,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:24:31,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:24:31,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:24:31,655 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:24:31,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:24:31,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:24:31,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:24:31,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:24:31,657 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:24:31,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:24:31,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:24:31,660 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:24:31,660 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:24:31,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:24:31,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:24:31,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:24:31,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:24:31,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:24:31,661 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:24:31,662 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:24:31,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:24:31,662 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:24:31,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:24:31,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:24:31,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:24:31,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:24:31,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:24:31,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:24:31,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:24:31,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:24:31,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:24:31,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:24:31,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:24:31,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:24:31,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:24:31,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:24:31,666 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 -> d4567c6a74ac7eac1fa65db4db5999d3a1dd022fa97829ecd98c8e766f1d922f [2024-10-11 04:24:31,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:24:31,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:24:31,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:24:31,925 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:24:31,926 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:24:31,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.08.cil-1.c [2024-10-11 04:24:33,319 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:24:33,860 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:24:33,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.08.cil-1.c [2024-10-11 04:24:33,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/60b3a38e9/f0a49bb790784e68b4a5c0619c4d2d79/FLAG6ad4cb2ed [2024-10-11 04:24:33,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/60b3a38e9/f0a49bb790784e68b4a5c0619c4d2d79 [2024-10-11 04:24:33,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:24:33,930 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:24:33,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:24:33,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:24:33,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:24:33,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:24:33" (1/1) ... [2024-10-11 04:24:33,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4218e73a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:33, skipping insertion in model container [2024-10-11 04:24:33,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:24:33" (1/1) ... [2024-10-11 04:24:34,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:24:35,635 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_label47+token_ring.08.cil-1.c[377612,377625] [2024-10-11 04:24:35,658 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_label47+token_ring.08.cil-1.c[383339,383352] [2024-10-11 04:24:35,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:24:35,904 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:24:36,555 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_label47+token_ring.08.cil-1.c[377612,377625] [2024-10-11 04:24:36,563 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_label47+token_ring.08.cil-1.c[383339,383352] [2024-10-11 04:24:36,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:24:36,637 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:24:36,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:36 WrapperNode [2024-10-11 04:24:36,638 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:24:36,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:24:36,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:24:36,640 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:24:36,646 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:24:36" (1/1) ... [2024-10-11 04:24:36,716 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:24:36" (1/1) ... [2024-10-11 04:24:36,986 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12993 [2024-10-11 04:24:36,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:24:36,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:24:36,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:24:36,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:24:36,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:36" (1/1) ... [2024-10-11 04:24:36,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:36" (1/1) ... [2024-10-11 04:24:37,043 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:36" (1/1) ... [2024-10-11 04:24:37,137 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:24:37,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:36" (1/1) ... [2024-10-11 04:24:37,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:36" (1/1) ... [2024-10-11 04:24:37,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:24:36" (1/1) ... [2024-10-11 04:24:37,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:36" (1/1) ... [2024-10-11 04:24:37,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:36" (1/1) ... [2024-10-11 04:24:37,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:36" (1/1) ... [2024-10-11 04:24:37,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:24:37,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:24:37,568 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:24:37,568 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:24:37,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:36" (1/1) ... [2024-10-11 04:24:37,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:24:37,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:24:37,601 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:24:37,603 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:24:37,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:24:37,646 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:24:37,647 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:24:37,647 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:24:37,648 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:24:37,648 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:24:37,649 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:24:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:24:37,649 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:24:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:24:37,649 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:24:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:24:37,650 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:24:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:24:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:24:37,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:24:37,753 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:24:37,754 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:24:43,769 INFO L? ?]: Removed 1731 outVars from TransFormulas that were not future-live. [2024-10-11 04:24:43,770 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:24:43,870 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:24:43,871 INFO L314 CfgBuilder]: Removed 12 assume(true) statements. [2024-10-11 04:24:43,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:24:43 BoogieIcfgContainer [2024-10-11 04:24:43,871 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:24:43,880 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:24:43,880 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:24:43,883 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:24:43,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:24:33" (1/3) ... [2024-10-11 04:24:43,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618f08bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:24:43, skipping insertion in model container [2024-10-11 04:24:43,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:24:36" (2/3) ... [2024-10-11 04:24:43,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618f08bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:24:43, skipping insertion in model container [2024-10-11 04:24:43,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:24:43" (3/3) ... [2024-10-11 04:24:43,889 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label47+token_ring.08.cil-1.c [2024-10-11 04:24:43,917 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:24:43,917 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:24:44,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:24:44,026 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;@73f6112a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:24:44,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:24:44,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 2379 states, 2348 states have (on average 1.8794718909710393) internal successors, (4413), 2351 states have internal predecessors, (4413), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 04:24:44,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 04:24:44,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:44,049 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] [2024-10-11 04:24:44,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:44,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:44,055 INFO L85 PathProgramCache]: Analyzing trace with hash 2060137260, now seen corresponding path program 1 times [2024-10-11 04:24:44,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:44,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100867410] [2024-10-11 04:24:44,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:44,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:44,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:44,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:24:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:44,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:44,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:24:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:44,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:24:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:44,537 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:24:44,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:44,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100867410] [2024-10-11 04:24:44,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100867410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:44,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:44,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:24:44,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337136887] [2024-10-11 04:24:44,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:44,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:24:44,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:44,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:24:44,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:24:44,574 INFO L87 Difference]: Start difference. First operand has 2379 states, 2348 states have (on average 1.8794718909710393) internal successors, (4413), 2351 states have internal predecessors, (4413), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 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:24:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:46,091 INFO L93 Difference]: Finished difference Result 4844 states and 9066 transitions. [2024-10-11 04:24:46,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:24:46,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 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 121 [2024-10-11 04:24:46,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:46,113 INFO L225 Difference]: With dead ends: 4844 [2024-10-11 04:24:46,117 INFO L226 Difference]: Without dead ends: 2465 [2024-10-11 04:24:46,128 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:24:46,138 INFO L432 NwaCegarLoop]: 4181 mSDtfsCounter, 695 mSDsluCounter, 12116 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 16297 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:46,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 16297 Invalid, 806 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:24:46,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2024-10-11 04:24:46,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2375. [2024-10-11 04:24:46,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2345 states have (on average 1.8426439232409382) internal successors, (4321), 2347 states have internal predecessors, (4321), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 04:24:46,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 4365 transitions. [2024-10-11 04:24:46,277 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 4365 transitions. Word has length 121 [2024-10-11 04:24:46,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:46,278 INFO L471 AbstractCegarLoop]: Abstraction has 2375 states and 4365 transitions. [2024-10-11 04:24:46,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 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:24:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 4365 transitions. [2024-10-11 04:24:46,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 04:24:46,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:46,284 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] [2024-10-11 04:24:46,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:24:46,285 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:46,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:46,285 INFO L85 PathProgramCache]: Analyzing trace with hash 58250990, now seen corresponding path program 1 times [2024-10-11 04:24:46,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:46,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945618929] [2024-10-11 04:24:46,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:46,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:46,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:46,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:24:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:46,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:46,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:24:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:46,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:24:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:46,625 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:24:46,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:46,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945618929] [2024-10-11 04:24:46,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945618929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:46,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:46,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:24:46,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727665718] [2024-10-11 04:24:46,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:46,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:24:46,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:46,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:24:46,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:24:46,635 INFO L87 Difference]: Start difference. First operand 2375 states and 4365 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 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:24:48,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:48,324 INFO L93 Difference]: Finished difference Result 3046 states and 5475 transitions. [2024-10-11 04:24:48,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:24:48,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 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 121 [2024-10-11 04:24:48,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:48,335 INFO L225 Difference]: With dead ends: 3046 [2024-10-11 04:24:48,336 INFO L226 Difference]: Without dead ends: 2806 [2024-10-11 04:24:48,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:24:48,339 INFO L432 NwaCegarLoop]: 4154 mSDtfsCounter, 4998 mSDsluCounter, 12445 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5013 SdHoareTripleChecker+Valid, 16599 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:48,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5013 Valid, 16599 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:24:48,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2024-10-11 04:24:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2627. [2024-10-11 04:24:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 2573 states have (on average 1.8239409249902838) internal successors, (4693), 2576 states have internal predecessors, (4693), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-10-11 04:24:48,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 4774 transitions. [2024-10-11 04:24:48,402 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 4774 transitions. Word has length 121 [2024-10-11 04:24:48,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:48,402 INFO L471 AbstractCegarLoop]: Abstraction has 2627 states and 4774 transitions. [2024-10-11 04:24:48,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 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:24:48,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 4774 transitions. [2024-10-11 04:24:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 04:24:48,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:48,404 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] [2024-10-11 04:24:48,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:24:48,404 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:48,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:48,405 INFO L85 PathProgramCache]: Analyzing trace with hash 603539502, now seen corresponding path program 1 times [2024-10-11 04:24:48,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:48,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534981151] [2024-10-11 04:24:48,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:48,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:48,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:48,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:24:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:48,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:48,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:24:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:48,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:24:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:48,672 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:24:48,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:48,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534981151] [2024-10-11 04:24:48,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534981151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:48,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:48,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:48,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925924186] [2024-10-11 04:24:48,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:48,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:48,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:48,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:48,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:48,678 INFO L87 Difference]: Start difference. First operand 2627 states and 4774 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:24:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:51,061 INFO L93 Difference]: Finished difference Result 3651 states and 6465 transitions. [2024-10-11 04:24:51,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:24:51,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-11 04:24:51,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:51,077 INFO L225 Difference]: With dead ends: 3651 [2024-10-11 04:24:51,077 INFO L226 Difference]: Without dead ends: 3159 [2024-10-11 04:24:51,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:24:51,084 INFO L432 NwaCegarLoop]: 4300 mSDtfsCounter, 5019 mSDsluCounter, 16941 mSDsCounter, 0 mSdLazyCounter, 2638 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5034 SdHoareTripleChecker+Valid, 21241 SdHoareTripleChecker+Invalid, 2691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:51,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5034 Valid, 21241 Invalid, 2691 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [53 Valid, 2638 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 04:24:51,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3159 states. [2024-10-11 04:24:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3159 to 2860. [2024-10-11 04:24:51,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2782 states have (on average 1.8069734004313445) internal successors, (5027), 2786 states have internal predecessors, (5027), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-10-11 04:24:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 5144 transitions. [2024-10-11 04:24:51,170 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 5144 transitions. Word has length 121 [2024-10-11 04:24:51,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:51,171 INFO L471 AbstractCegarLoop]: Abstraction has 2860 states and 5144 transitions. [2024-10-11 04:24:51,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:24:51,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 5144 transitions. [2024-10-11 04:24:51,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 04:24:51,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:51,174 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] [2024-10-11 04:24:51,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:24:51,175 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:51,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:51,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1429854544, now seen corresponding path program 1 times [2024-10-11 04:24:51,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:51,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767043703] [2024-10-11 04:24:51,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:51,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:51,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:51,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:24:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:51,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:51,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:24:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:51,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:24:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:51,442 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:24:51,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:51,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767043703] [2024-10-11 04:24:51,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767043703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:51,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:51,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:51,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810238496] [2024-10-11 04:24:51,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:51,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:51,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:51,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:51,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:51,445 INFO L87 Difference]: Start difference. First operand 2860 states and 5144 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:24:53,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:53,420 INFO L93 Difference]: Finished difference Result 4537 states and 7907 transitions. [2024-10-11 04:24:53,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:24:53,421 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-11 04:24:53,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:53,454 INFO L225 Difference]: With dead ends: 4537 [2024-10-11 04:24:53,454 INFO L226 Difference]: Without dead ends: 3812 [2024-10-11 04:24:53,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:24:53,465 INFO L432 NwaCegarLoop]: 4163 mSDtfsCounter, 5097 mSDsluCounter, 16578 mSDsCounter, 0 mSdLazyCounter, 2188 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5112 SdHoareTripleChecker+Valid, 20741 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:53,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5112 Valid, 20741 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2188 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:24:53,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3812 states. [2024-10-11 04:24:53,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3812 to 3327. [2024-10-11 04:24:53,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 3201 states have (on average 1.7794439237738207) internal successors, (5696), 3207 states have internal predecessors, (5696), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-11 04:24:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 5889 transitions. [2024-10-11 04:24:53,679 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 5889 transitions. Word has length 121 [2024-10-11 04:24:53,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:53,682 INFO L471 AbstractCegarLoop]: Abstraction has 3327 states and 5889 transitions. [2024-10-11 04:24:53,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:24:53,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 5889 transitions. [2024-10-11 04:24:53,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 04:24:53,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:53,684 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] [2024-10-11 04:24:53,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:24:53,685 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:53,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:53,685 INFO L85 PathProgramCache]: Analyzing trace with hash 998404078, now seen corresponding path program 1 times [2024-10-11 04:24:53,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:53,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730630156] [2024-10-11 04:24:53,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:53,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:53,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:53,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:24:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:53,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:53,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:24:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:53,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:24:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:53,972 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:24:53,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:53,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730630156] [2024-10-11 04:24:53,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730630156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:53,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:53,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:53,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457959790] [2024-10-11 04:24:53,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:53,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:53,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:53,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:53,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:53,978 INFO L87 Difference]: Start difference. First operand 3327 states and 5889 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:24:55,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:55,501 INFO L93 Difference]: Finished difference Result 4994 states and 8645 transitions. [2024-10-11 04:24:55,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:24:55,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-11 04:24:55,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:55,537 INFO L225 Difference]: With dead ends: 4994 [2024-10-11 04:24:55,537 INFO L226 Difference]: Without dead ends: 3802 [2024-10-11 04:24:55,546 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:24:55,551 INFO L432 NwaCegarLoop]: 4141 mSDtfsCounter, 4728 mSDsluCounter, 16388 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4744 SdHoareTripleChecker+Valid, 20529 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:55,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4744 Valid, 20529 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:24:55,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2024-10-11 04:24:55,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 3327. [2024-10-11 04:24:55,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 3201 states have (on average 1.7778819119025304) internal successors, (5691), 3207 states have internal predecessors, (5691), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-11 04:24:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 5884 transitions. [2024-10-11 04:24:55,753 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 5884 transitions. Word has length 121 [2024-10-11 04:24:55,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:55,754 INFO L471 AbstractCegarLoop]: Abstraction has 3327 states and 5884 transitions. [2024-10-11 04:24:55,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:24:55,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 5884 transitions. [2024-10-11 04:24:55,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 04:24:55,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:55,756 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] [2024-10-11 04:24:55,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:24:55,757 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:55,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:55,758 INFO L85 PathProgramCache]: Analyzing trace with hash -308738320, now seen corresponding path program 1 times [2024-10-11 04:24:55,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:55,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865177232] [2024-10-11 04:24:55,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:55,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:55,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:55,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:24:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:55,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:55,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:24:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:55,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:24:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:55,966 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:24:55,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:55,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865177232] [2024-10-11 04:24:55,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865177232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:55,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:55,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:55,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234130483] [2024-10-11 04:24:55,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:55,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:55,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:55,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:55,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:55,970 INFO L87 Difference]: Start difference. First operand 3327 states and 5884 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:24:57,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:24:57,047 INFO L93 Difference]: Finished difference Result 4983 states and 8609 transitions. [2024-10-11 04:24:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:24:57,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-11 04:24:57,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:24:57,062 INFO L225 Difference]: With dead ends: 4983 [2024-10-11 04:24:57,062 INFO L226 Difference]: Without dead ends: 3791 [2024-10-11 04:24:57,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:24:57,070 INFO L432 NwaCegarLoop]: 4141 mSDtfsCounter, 4833 mSDsluCounter, 12312 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4849 SdHoareTripleChecker+Valid, 16453 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:24:57,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4849 Valid, 16453 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:24:57,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3791 states. [2024-10-11 04:24:57,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3791 to 3327. [2024-10-11 04:24:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 3201 states have (on average 1.7763199000312402) internal successors, (5686), 3207 states have internal predecessors, (5686), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-11 04:24:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 5879 transitions. [2024-10-11 04:24:57,210 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 5879 transitions. Word has length 121 [2024-10-11 04:24:57,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:24:57,210 INFO L471 AbstractCegarLoop]: Abstraction has 3327 states and 5879 transitions. [2024-10-11 04:24:57,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:24:57,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 5879 transitions. [2024-10-11 04:24:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 04:24:57,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:24:57,213 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] [2024-10-11 04:24:57,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:24:57,214 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:24:57,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:24:57,214 INFO L85 PathProgramCache]: Analyzing trace with hash 722302578, now seen corresponding path program 1 times [2024-10-11 04:24:57,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:24:57,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253962912] [2024-10-11 04:24:57,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:24:57,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:24:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:57,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:24:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:57,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:24:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:57,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:24:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:57,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:24:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:57,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:24:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:24:57,409 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:24:57,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:24:57,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253962912] [2024-10-11 04:24:57,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253962912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:24:57,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:24:57,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:24:57,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251915332] [2024-10-11 04:24:57,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:24:57,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:24:57,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:24:57,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:24:57,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:24:57,415 INFO L87 Difference]: Start difference. First operand 3327 states and 5879 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:25:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:00,017 INFO L93 Difference]: Finished difference Result 6219 states and 10582 transitions. [2024-10-11 04:25:00,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:25:00,018 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-11 04:25:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:00,035 INFO L225 Difference]: With dead ends: 6219 [2024-10-11 04:25:00,036 INFO L226 Difference]: Without dead ends: 5027 [2024-10-11 04:25:00,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:25:00,041 INFO L432 NwaCegarLoop]: 4298 mSDtfsCounter, 5002 mSDsluCounter, 16941 mSDsCounter, 0 mSdLazyCounter, 2559 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5017 SdHoareTripleChecker+Valid, 21239 SdHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:00,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5017 Valid, 21239 Invalid, 2614 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [55 Valid, 2559 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 04:25:00,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5027 states. [2024-10-11 04:25:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5027 to 4276. [2024-10-11 04:25:00,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4054 states have (on average 1.735816477553034) internal successors, (7037), 4064 states have internal predecessors, (7037), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-11 04:25:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 7388 transitions. [2024-10-11 04:25:00,223 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 7388 transitions. Word has length 121 [2024-10-11 04:25:00,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:00,225 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 7388 transitions. [2024-10-11 04:25:00,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:25:00,226 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 7388 transitions. [2024-10-11 04:25:00,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 04:25:00,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:00,228 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] [2024-10-11 04:25:00,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:25:00,229 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:00,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:00,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1184100688, now seen corresponding path program 1 times [2024-10-11 04:25:00,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:00,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643262826] [2024-10-11 04:25:00,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:00,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:00,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:00,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:25:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:00,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:00,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:25:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:00,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:25:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:00,380 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:25:00,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:00,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643262826] [2024-10-11 04:25:00,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643262826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:00,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:00,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:00,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815427052] [2024-10-11 04:25:00,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:00,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:00,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:00,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:00,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:00,382 INFO L87 Difference]: Start difference. First operand 4276 states and 7388 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:25:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:01,677 INFO L93 Difference]: Finished difference Result 7177 states and 12134 transitions. [2024-10-11 04:25:01,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:25:01,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-11 04:25:01,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:01,705 INFO L225 Difference]: With dead ends: 7177 [2024-10-11 04:25:01,705 INFO L226 Difference]: Without dead ends: 5036 [2024-10-11 04:25:01,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:25:01,714 INFO L432 NwaCegarLoop]: 4141 mSDtfsCounter, 4724 mSDsluCounter, 16388 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4740 SdHoareTripleChecker+Valid, 20529 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:01,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4740 Valid, 20529 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:25:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2024-10-11 04:25:01,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 4276. [2024-10-11 04:25:01,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4054 states have (on average 1.7335964479526393) internal successors, (7028), 4064 states have internal predecessors, (7028), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-11 04:25:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 7379 transitions. [2024-10-11 04:25:01,850 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 7379 transitions. Word has length 121 [2024-10-11 04:25:01,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:01,850 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 7379 transitions. [2024-10-11 04:25:01,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:25:01,851 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 7379 transitions. [2024-10-11 04:25:01,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 04:25:01,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:01,853 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] [2024-10-11 04:25:01,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:25:01,854 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:01,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:01,854 INFO L85 PathProgramCache]: Analyzing trace with hash 416970418, now seen corresponding path program 1 times [2024-10-11 04:25:01,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:01,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248305789] [2024-10-11 04:25:01,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:01,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:01,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:01,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:25:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:01,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:02,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:25:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:02,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:25:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:02,012 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:25:02,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:02,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248305789] [2024-10-11 04:25:02,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248305789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:02,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:02,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:02,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719631547] [2024-10-11 04:25:02,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:02,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:02,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:02,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:02,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:02,015 INFO L87 Difference]: Start difference. First operand 4276 states and 7379 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:25:04,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:04,247 INFO L93 Difference]: Finished difference Result 9610 states and 16003 transitions. [2024-10-11 04:25:04,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:25:04,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-11 04:25:04,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:04,266 INFO L225 Difference]: With dead ends: 9610 [2024-10-11 04:25:04,267 INFO L226 Difference]: Without dead ends: 7469 [2024-10-11 04:25:04,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:25:04,274 INFO L432 NwaCegarLoop]: 4298 mSDtfsCounter, 4994 mSDsluCounter, 16941 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5009 SdHoareTripleChecker+Valid, 21239 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:04,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5009 Valid, 21239 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:25:04,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7469 states. [2024-10-11 04:25:04,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7469 to 6184. [2024-10-11 04:25:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6184 states, 5770 states have (on average 1.6863084922010398) internal successors, (9730), 5788 states have internal predecessors, (9730), 294 states have call successors, (294), 102 states have call predecessors, (294), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-10-11 04:25:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6184 states to 6184 states and 10415 transitions. [2024-10-11 04:25:04,488 INFO L78 Accepts]: Start accepts. Automaton has 6184 states and 10415 transitions. Word has length 121 [2024-10-11 04:25:04,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:04,488 INFO L471 AbstractCegarLoop]: Abstraction has 6184 states and 10415 transitions. [2024-10-11 04:25:04,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:25:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 6184 states and 10415 transitions. [2024-10-11 04:25:04,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 04:25:04,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:04,492 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] [2024-10-11 04:25:04,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:25:04,492 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:04,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:04,492 INFO L85 PathProgramCache]: Analyzing trace with hash -639760784, now seen corresponding path program 1 times [2024-10-11 04:25:04,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:04,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18406603] [2024-10-11 04:25:04,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:04,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:04,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:04,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:25:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:04,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:04,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:25:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:04,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:25:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:04,627 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:25:04,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:04,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18406603] [2024-10-11 04:25:04,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18406603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:04,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:04,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:04,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51404072] [2024-10-11 04:25:04,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:04,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:04,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:04,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:04,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:04,629 INFO L87 Difference]: Start difference. First operand 6184 states and 10415 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:25:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:07,370 INFO L93 Difference]: Finished difference Result 18072 states and 29651 transitions. [2024-10-11 04:25:07,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:25:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-11 04:25:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:07,406 INFO L225 Difference]: With dead ends: 18072 [2024-10-11 04:25:07,406 INFO L226 Difference]: Without dead ends: 14023 [2024-10-11 04:25:07,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:25:07,420 INFO L432 NwaCegarLoop]: 4296 mSDtfsCounter, 5287 mSDsluCounter, 16936 mSDsCounter, 0 mSdLazyCounter, 2498 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5311 SdHoareTripleChecker+Valid, 21232 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:07,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5311 Valid, 21232 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2498 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 04:25:07,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14023 states. [2024-10-11 04:25:07,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14023 to 9981. [2024-10-11 04:25:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9981 states, 9199 states have (on average 1.6453962387216001) internal successors, (15136), 9233 states have internal predecessors, (15136), 550 states have call successors, (550), 198 states have call predecessors, (550), 230 states have return successors, (825), 581 states have call predecessors, (825), 550 states have call successors, (825) [2024-10-11 04:25:07,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9981 states to 9981 states and 16511 transitions. [2024-10-11 04:25:07,834 INFO L78 Accepts]: Start accepts. Automaton has 9981 states and 16511 transitions. Word has length 121 [2024-10-11 04:25:07,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:07,834 INFO L471 AbstractCegarLoop]: Abstraction has 9981 states and 16511 transitions. [2024-10-11 04:25:07,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:25:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand 9981 states and 16511 transitions. [2024-10-11 04:25:07,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 04:25:07,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:07,841 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] [2024-10-11 04:25:07,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:25:07,841 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:07,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:07,841 INFO L85 PathProgramCache]: Analyzing trace with hash 711624434, now seen corresponding path program 1 times [2024-10-11 04:25:07,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:07,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486950658] [2024-10-11 04:25:07,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:07,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:07,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:07,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:25:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:07,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:07,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:25:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:07,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:25:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:07,989 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:25:07,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:07,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486950658] [2024-10-11 04:25:07,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486950658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:07,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:07,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:07,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506363044] [2024-10-11 04:25:07,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:07,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:07,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:07,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:07,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:07,991 INFO L87 Difference]: Start difference. First operand 9981 states and 16511 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:25:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:11,219 INFO L93 Difference]: Finished difference Result 32883 states and 53741 transitions. [2024-10-11 04:25:11,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:25:11,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-11 04:25:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:11,378 INFO L225 Difference]: With dead ends: 32883 [2024-10-11 04:25:11,378 INFO L226 Difference]: Without dead ends: 25037 [2024-10-11 04:25:11,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:25:11,447 INFO L432 NwaCegarLoop]: 4189 mSDtfsCounter, 5120 mSDsluCounter, 16600 mSDsCounter, 0 mSdLazyCounter, 2636 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5134 SdHoareTripleChecker+Valid, 20789 SdHoareTripleChecker+Invalid, 2715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:11,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5134 Valid, 20789 Invalid, 2715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2636 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 04:25:11,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25037 states. [2024-10-11 04:25:13,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25037 to 17414. [2024-10-11 04:25:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17414 states, 15912 states have (on average 1.6165158371040724) internal successors, (25722), 15978 states have internal predecessors, (25722), 1046 states have call successors, (1046), 390 states have call predecessors, (1046), 454 states have return successors, (1839), 1109 states have call predecessors, (1839), 1046 states have call successors, (1839) [2024-10-11 04:25:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17414 states to 17414 states and 28607 transitions. [2024-10-11 04:25:13,153 INFO L78 Accepts]: Start accepts. Automaton has 17414 states and 28607 transitions. Word has length 121 [2024-10-11 04:25:13,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:13,153 INFO L471 AbstractCegarLoop]: Abstraction has 17414 states and 28607 transitions. [2024-10-11 04:25:13,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:25:13,154 INFO L276 IsEmpty]: Start isEmpty. Operand 17414 states and 28607 transitions. [2024-10-11 04:25:13,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 04:25:13,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:13,177 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] [2024-10-11 04:25:13,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:25:13,178 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:13,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash -907350480, now seen corresponding path program 1 times [2024-10-11 04:25:13,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:13,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934017009] [2024-10-11 04:25:13,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:13,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:13,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:13,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:25:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:13,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:13,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:25:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:13,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:25:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:13,493 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:25:13,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:13,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934017009] [2024-10-11 04:25:13,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934017009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:13,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:13,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:13,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185838609] [2024-10-11 04:25:13,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:13,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:13,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:13,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:13,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:13,500 INFO L87 Difference]: Start difference. First operand 17414 states and 28607 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:25:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:17,714 INFO L93 Difference]: Finished difference Result 61578 states and 100971 transitions. [2024-10-11 04:25:17,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:25:17,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-11 04:25:17,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:17,861 INFO L225 Difference]: With dead ends: 61578 [2024-10-11 04:25:17,861 INFO L226 Difference]: Without dead ends: 46299 [2024-10-11 04:25:17,915 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:25:17,915 INFO L432 NwaCegarLoop]: 4296 mSDtfsCounter, 5221 mSDsluCounter, 16936 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5245 SdHoareTripleChecker+Valid, 21232 SdHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:17,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5245 Valid, 21232 Invalid, 2525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2467 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 04:25:17,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46299 states. [2024-10-11 04:25:19,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46299 to 32439. [2024-10-11 04:25:19,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32439 states, 29529 states have (on average 1.598835043516543) internal successors, (47212), 29659 states have internal predecessors, (47212), 2006 states have call successors, (2006), 774 states have call predecessors, (2006), 902 states have return successors, (4321), 2133 states have call predecessors, (4321), 2006 states have call successors, (4321) [2024-10-11 04:25:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32439 states to 32439 states and 53539 transitions. [2024-10-11 04:25:19,952 INFO L78 Accepts]: Start accepts. Automaton has 32439 states and 53539 transitions. Word has length 121 [2024-10-11 04:25:19,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:19,952 INFO L471 AbstractCegarLoop]: Abstraction has 32439 states and 53539 transitions. [2024-10-11 04:25:19,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:25:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 32439 states and 53539 transitions. [2024-10-11 04:25:19,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 04:25:19,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:19,970 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] [2024-10-11 04:25:19,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:25:19,970 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:19,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:19,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1790859470, now seen corresponding path program 1 times [2024-10-11 04:25:19,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:19,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794303972] [2024-10-11 04:25:19,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:19,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:20,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:20,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:25:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:20,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:20,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:25:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:20,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:25:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:20,118 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:25:20,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:20,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794303972] [2024-10-11 04:25:20,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794303972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:20,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:20,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:20,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584528759] [2024-10-11 04:25:20,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:20,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:20,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:20,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:20,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:20,120 INFO L87 Difference]: Start difference. First operand 32439 states and 53539 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:25:26,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:26,995 INFO L93 Difference]: Finished difference Result 116759 states and 193853 transitions. [2024-10-11 04:25:26,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:25:26,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-11 04:25:26,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:27,322 INFO L225 Difference]: With dead ends: 116759 [2024-10-11 04:25:27,323 INFO L226 Difference]: Without dead ends: 86455 [2024-10-11 04:25:27,409 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:25:27,410 INFO L432 NwaCegarLoop]: 4296 mSDtfsCounter, 5030 mSDsluCounter, 16936 mSDsCounter, 0 mSdLazyCounter, 2755 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5044 SdHoareTripleChecker+Valid, 21232 SdHoareTripleChecker+Invalid, 2812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:27,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5044 Valid, 21232 Invalid, 2812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2755 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 04:25:27,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86455 states. [2024-10-11 04:25:31,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86455 to 62617. [2024-10-11 04:25:31,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62617 states, 56955 states have (on average 1.5903081380036872) internal successors, (90576), 57213 states have internal predecessors, (90576), 3862 states have call successors, (3862), 1542 states have call predecessors, (3862), 1798 states have return successors, (10679), 4117 states have call predecessors, (10679), 3862 states have call successors, (10679) [2024-10-11 04:25:31,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62617 states to 62617 states and 105117 transitions. [2024-10-11 04:25:31,287 INFO L78 Accepts]: Start accepts. Automaton has 62617 states and 105117 transitions. Word has length 121 [2024-10-11 04:25:31,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:25:31,289 INFO L471 AbstractCegarLoop]: Abstraction has 62617 states and 105117 transitions. [2024-10-11 04:25:31,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:25:31,289 INFO L276 IsEmpty]: Start isEmpty. Operand 62617 states and 105117 transitions. [2024-10-11 04:25:31,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 04:25:31,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:25:31,330 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] [2024-10-11 04:25:31,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:25:31,331 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:25:31,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:25:31,331 INFO L85 PathProgramCache]: Analyzing trace with hash 563525812, now seen corresponding path program 1 times [2024-10-11 04:25:31,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:25:31,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933538832] [2024-10-11 04:25:31,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:25:31,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:25:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:31,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:25:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:31,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:25:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:31,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:25:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:31,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:25:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:31,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:25:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:25:31,481 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:25:31,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:25:31,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933538832] [2024-10-11 04:25:31,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933538832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:25:31,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:25:31,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:25:31,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739846694] [2024-10-11 04:25:31,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:25:31,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:25:31,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:25:31,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:25:31,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:25:31,483 INFO L87 Difference]: Start difference. First operand 62617 states and 105117 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:25:43,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:25:43,585 INFO L93 Difference]: Finished difference Result 226999 states and 384949 transitions. [2024-10-11 04:25:43,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:25:43,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2024-10-11 04:25:43,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:25:44,628 INFO L225 Difference]: With dead ends: 226999 [2024-10-11 04:25:44,628 INFO L226 Difference]: Without dead ends: 166517 [2024-10-11 04:25:44,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:25:44,797 INFO L432 NwaCegarLoop]: 4296 mSDtfsCounter, 5110 mSDsluCounter, 16936 mSDsCounter, 0 mSdLazyCounter, 2427 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5134 SdHoareTripleChecker+Valid, 21232 SdHoareTripleChecker+Invalid, 2485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:25:44,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5134 Valid, 21232 Invalid, 2485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2427 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:25:44,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166517 states.