./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_label45+token_ring.07.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.07.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b4c883892095e0f755900dfa24a6bc793b8370cf6ff9d1a6368a9f789f01f5b0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:28:52,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:28:52,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 04:28:52,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:28:52,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:28:52,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:28:52,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:28:52,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:28:52,812 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:28:52,812 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:28:52,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:28:52,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:28:52,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:28:52,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:28:52,814 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:28:52,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:28:52,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:28:52,818 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:28:52,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 04:28:52,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:28:52,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:28:52,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:28:52,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:28:52,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:28:52,822 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:28:52,823 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:28:52,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:28:52,824 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:28:52,824 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:28:52,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:28:52,826 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:28:52,826 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:28:52,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:28:52,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:28:52,827 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:28:52,827 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:28:52,827 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 04:28:52,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 04:28:52,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:28:52,828 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:28:52,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:28:52,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:28:52,842 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b4c883892095e0f755900dfa24a6bc793b8370cf6ff9d1a6368a9f789f01f5b0 [2024-10-14 04:28:53,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:28:53,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:28:53,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:28:53,138 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:28:53,139 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:28:53,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.07.cil-1.c [2024-10-14 04:28:54,641 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:28:55,254 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:28:55,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.07.cil-1.c [2024-10-14 04:28:55,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa3570550/f6248ba73b8c4076b13a196e69afda2f/FLAGf93ca010b [2024-10-14 04:28:55,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa3570550/f6248ba73b8c4076b13a196e69afda2f [2024-10-14 04:28:55,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:28:55,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:28:55,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:28:55,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:28:55,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:28:55,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:28:55" (1/1) ... [2024-10-14 04:28:55,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2901fbff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:28:55, skipping insertion in model container [2024-10-14 04:28:55,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:28:55" (1/1) ... [2024-10-14 04:28:55,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:28:57,374 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_label45+token_ring.07.cil-1.c[380323,380336] [2024-10-14 04:28:57,416 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_label45+token_ring.07.cil-1.c[383339,383352] [2024-10-14 04:28:57,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:28:57,662 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:28:58,397 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_label45+token_ring.07.cil-1.c[380323,380336] [2024-10-14 04:28:58,403 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_label45+token_ring.07.cil-1.c[383339,383352] [2024-10-14 04:28:58,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:28:58,489 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:28:58,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:28:58 WrapperNode [2024-10-14 04:28:58,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:28:58,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:28:58,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:28:58,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:28:58,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:28:58" (1/1) ... [2024-10-14 04:28:58,617 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:28:58" (1/1) ... [2024-10-14 04:28:59,088 INFO L138 Inliner]: procedures = 58, calls = 62, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 12933 [2024-10-14 04:28:59,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:28:59,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:28:59,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:28:59,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:28:59,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:28:58" (1/1) ... [2024-10-14 04:28:59,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:28:58" (1/1) ... [2024-10-14 04:28:59,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:28:58" (1/1) ... [2024-10-14 04:28:59,277 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-14 04:28:59,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:28:58" (1/1) ... [2024-10-14 04:28:59,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:28:58" (1/1) ... [2024-10-14 04:28:59,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:28:58" (1/1) ... [2024-10-14 04:28:59,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:28:58" (1/1) ... [2024-10-14 04:28:59,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:28:58" (1/1) ... [2024-10-14 04:28:59,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:28:58" (1/1) ... [2024-10-14 04:28:59,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:28:59,631 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:28:59,631 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:28:59,631 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:28:59,633 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:28:58" (1/1) ... [2024-10-14 04:28:59,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:28:59,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:28:59,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 04:28:59,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 04:28:59,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:28:59,859 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 04:28:59,859 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 04:28:59,859 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 04:28:59,860 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 04:28:59,860 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 04:28:59,860 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 04:28:59,860 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 04:28:59,860 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 04:28:59,860 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 04:28:59,860 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 04:28:59,860 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 04:28:59,860 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 04:28:59,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 04:28:59,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:28:59,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:28:59,972 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:28:59,975 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:29:07,807 INFO L? ?]: Removed 1725 outVars from TransFormulas that were not future-live. [2024-10-14 04:29:07,807 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:29:07,953 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:29:07,954 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-14 04:29:07,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:29:07 BoogieIcfgContainer [2024-10-14 04:29:07,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:29:07,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:29:07,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:29:07,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:29:07,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:28:55" (1/3) ... [2024-10-14 04:29:07,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b920a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:29:07, skipping insertion in model container [2024-10-14 04:29:07,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:28:58" (2/3) ... [2024-10-14 04:29:07,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b920a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:29:07, skipping insertion in model container [2024-10-14 04:29:07,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:29:07" (3/3) ... [2024-10-14 04:29:07,965 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.07.cil-1.c [2024-10-14 04:29:07,985 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:29:07,985 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 04:29:08,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:29:08,122 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;@4bcf2ac5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:29:08,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 04:29:08,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 2356 states, 2326 states have (on average 1.880481513327601) internal successors, (4374), 2329 states have internal predecessors, (4374), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 04:29:08,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:29:08,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:29:08,159 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] [2024-10-14 04:29:08,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:29:08,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:29:08,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1751521651, now seen corresponding path program 1 times [2024-10-14 04:29:08,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:29:08,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115121749] [2024-10-14 04:29:08,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:29:08,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:29:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:08,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:29:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:08,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:29:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:08,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:29:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:08,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:29:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:08,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:29:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:08,767 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-14 04:29:08,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:29:08,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115121749] [2024-10-14 04:29:08,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115121749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:29:08,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:29:08,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 04:29:08,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183783396] [2024-10-14 04:29:08,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:29:08,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:29:08,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:29:08,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:29:08,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:29:08,818 INFO L87 Difference]: Start difference. First operand has 2356 states, 2326 states have (on average 1.880481513327601) internal successors, (4374), 2329 states have internal predecessors, (4374), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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-14 04:29:10,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:29:10,262 INFO L93 Difference]: Finished difference Result 4782 states and 8954 transitions. [2024-10-14 04:29:10,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:29:10,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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 111 [2024-10-14 04:29:10,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:29:10,299 INFO L225 Difference]: With dead ends: 4782 [2024-10-14 04:29:10,299 INFO L226 Difference]: Without dead ends: 2432 [2024-10-14 04:29:10,313 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-14 04:29:10,317 INFO L432 NwaCegarLoop]: 4162 mSDtfsCounter, 618 mSDsluCounter, 12094 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 16256 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:29:10,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 16256 Invalid, 726 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [46 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 04:29:10,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2024-10-14 04:29:10,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2352. [2024-10-14 04:29:10,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 2323 states have (on average 1.8441670253981919) internal successors, (4284), 2325 states have internal predecessors, (4284), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 04:29:10,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 4326 transitions. [2024-10-14 04:29:10,508 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 4326 transitions. Word has length 111 [2024-10-14 04:29:10,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:29:10,509 INFO L471 AbstractCegarLoop]: Abstraction has 2352 states and 4326 transitions. [2024-10-14 04:29:10,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 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-14 04:29:10,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 4326 transitions. [2024-10-14 04:29:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:29:10,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:29:10,513 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] [2024-10-14 04:29:10,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 04:29:10,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:29:10,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:29:10,515 INFO L85 PathProgramCache]: Analyzing trace with hash -637042379, now seen corresponding path program 1 times [2024-10-14 04:29:10,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:29:10,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999358631] [2024-10-14 04:29:10,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:29:10,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:29:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:10,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:29:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:10,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:29:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:10,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:29:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:10,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:29:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:10,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:29:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:10,869 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-14 04:29:10,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:29:10,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999358631] [2024-10-14 04:29:10,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999358631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:29:10,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:29:10,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:29:10,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523553675] [2024-10-14 04:29:10,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:29:10,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:29:10,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:29:10,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:29:10,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:29:10,877 INFO L87 Difference]: Start difference. First operand 2352 states and 4326 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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-14 04:29:12,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:29:12,913 INFO L93 Difference]: Finished difference Result 2957 states and 5322 transitions. [2024-10-14 04:29:12,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 04:29:12,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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 111 [2024-10-14 04:29:12,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:29:12,927 INFO L225 Difference]: With dead ends: 2957 [2024-10-14 04:29:12,927 INFO L226 Difference]: Without dead ends: 2739 [2024-10-14 04:29:12,930 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-14 04:29:12,931 INFO L432 NwaCegarLoop]: 4137 mSDtfsCounter, 4889 mSDsluCounter, 12392 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4903 SdHoareTripleChecker+Valid, 16529 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 04:29:12,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4903 Valid, 16529 Invalid, 1541 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [88 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 04:29:12,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2739 states. [2024-10-14 04:29:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2739 to 2580. [2024-10-14 04:29:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2580 states, 2528 states have (on average 1.8263449367088607) internal successors, (4617), 2531 states have internal predecessors, (4617), 37 states have call successors, (37), 12 states have call predecessors, (37), 13 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2024-10-14 04:29:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 4694 transitions. [2024-10-14 04:29:13,013 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 4694 transitions. Word has length 111 [2024-10-14 04:29:13,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:29:13,013 INFO L471 AbstractCegarLoop]: Abstraction has 2580 states and 4694 transitions. [2024-10-14 04:29:13,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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-14 04:29:13,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 4694 transitions. [2024-10-14 04:29:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:29:13,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:29:13,016 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] [2024-10-14 04:29:13,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 04:29:13,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:29:13,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:29:13,017 INFO L85 PathProgramCache]: Analyzing trace with hash 641956281, now seen corresponding path program 1 times [2024-10-14 04:29:13,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:29:13,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833270011] [2024-10-14 04:29:13,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:29:13,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:29:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:13,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:29:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:13,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:29:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:13,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:29:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:13,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:29:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:13,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:29:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:13,310 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-14 04:29:13,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:29:13,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833270011] [2024-10-14 04:29:13,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833270011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:29:13,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:29:13,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:29:13,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090121923] [2024-10-14 04:29:13,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:29:13,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:29:13,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:29:13,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:29:13,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:29:13,314 INFO L87 Difference]: Start difference. First operand 2580 states and 4694 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:15,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:29:15,973 INFO L93 Difference]: Finished difference Result 3502 states and 6208 transitions. [2024-10-14 04:29:15,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:29:15,974 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-14 04:29:15,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:29:15,994 INFO L225 Difference]: With dead ends: 3502 [2024-10-14 04:29:15,994 INFO L226 Difference]: Without dead ends: 3056 [2024-10-14 04:29:15,998 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-14 04:29:15,999 INFO L432 NwaCegarLoop]: 4270 mSDtfsCounter, 4904 mSDsluCounter, 16836 mSDsCounter, 0 mSdLazyCounter, 2373 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4918 SdHoareTripleChecker+Valid, 21106 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:29:16,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4918 Valid, 21106 Invalid, 2424 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [51 Valid, 2373 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 04:29:16,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2024-10-14 04:29:16,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 2791. [2024-10-14 04:29:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2791 states, 2716 states have (on average 1.8100147275405007) internal successors, (4916), 2720 states have internal predecessors, (4916), 53 states have call successors, (53), 18 states have call predecessors, (53), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-10-14 04:29:16,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 5027 transitions. [2024-10-14 04:29:16,238 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 5027 transitions. Word has length 111 [2024-10-14 04:29:16,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:29:16,239 INFO L471 AbstractCegarLoop]: Abstraction has 2791 states and 5027 transitions. [2024-10-14 04:29:16,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 5027 transitions. [2024-10-14 04:29:16,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:29:16,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:29:16,243 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] [2024-10-14 04:29:16,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 04:29:16,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:29:16,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:29:16,245 INFO L85 PathProgramCache]: Analyzing trace with hash -977018633, now seen corresponding path program 1 times [2024-10-14 04:29:16,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:29:16,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330053743] [2024-10-14 04:29:16,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:29:16,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:29:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:16,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:29:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:16,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:29:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:16,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:29:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:16,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:29:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:16,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:29:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:16,521 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-14 04:29:16,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:29:16,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330053743] [2024-10-14 04:29:16,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330053743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:29:16,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:29:16,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:29:16,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671786048] [2024-10-14 04:29:16,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:29:16,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:29:16,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:29:16,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:29:16,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:29:16,525 INFO L87 Difference]: Start difference. First operand 2791 states and 5027 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:18,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:29:18,757 INFO L93 Difference]: Finished difference Result 4300 states and 7499 transitions. [2024-10-14 04:29:18,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:29:18,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-14 04:29:18,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:29:18,779 INFO L225 Difference]: With dead ends: 4300 [2024-10-14 04:29:18,780 INFO L226 Difference]: Without dead ends: 3643 [2024-10-14 04:29:18,785 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-14 04:29:18,786 INFO L432 NwaCegarLoop]: 4268 mSDtfsCounter, 4902 mSDsluCounter, 16836 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4916 SdHoareTripleChecker+Valid, 21104 SdHoareTripleChecker+Invalid, 2422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 04:29:18,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4916 Valid, 21104 Invalid, 2422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 04:29:18,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2024-10-14 04:29:18,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3214. [2024-10-14 04:29:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 3093 states have (on average 1.7830585192369868) internal successors, (5515), 3099 states have internal predecessors, (5515), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-14 04:29:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5698 transitions. [2024-10-14 04:29:18,930 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5698 transitions. Word has length 111 [2024-10-14 04:29:18,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:29:18,931 INFO L471 AbstractCegarLoop]: Abstraction has 3214 states and 5698 transitions. [2024-10-14 04:29:18,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:18,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5698 transitions. [2024-10-14 04:29:18,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:29:18,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:29:18,934 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] [2024-10-14 04:29:18,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 04:29:18,935 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:29:18,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:29:18,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1860527623, now seen corresponding path program 1 times [2024-10-14 04:29:18,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:29:18,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223720100] [2024-10-14 04:29:18,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:29:18,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:29:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:19,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:29:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:19,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:29:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:19,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:29:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:19,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:29:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:19,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:29:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:19,158 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-14 04:29:19,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:29:19,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223720100] [2024-10-14 04:29:19,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223720100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:29:19,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:29:19,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:29:19,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185999319] [2024-10-14 04:29:19,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:29:19,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:29:19,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:29:19,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:29:19,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:29:19,164 INFO L87 Difference]: Start difference. First operand 3214 states and 5698 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:29:20,449 INFO L93 Difference]: Finished difference Result 4713 states and 8163 transitions. [2024-10-14 04:29:20,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:29:20,450 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-14 04:29:20,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:29:20,467 INFO L225 Difference]: With dead ends: 4713 [2024-10-14 04:29:20,468 INFO L226 Difference]: Without dead ends: 3633 [2024-10-14 04:29:20,473 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-14 04:29:20,475 INFO L432 NwaCegarLoop]: 4124 mSDtfsCounter, 4645 mSDsluCounter, 16334 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4660 SdHoareTripleChecker+Valid, 20458 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:29:20,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4660 Valid, 20458 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 04:29:20,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2024-10-14 04:29:20,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 3214. [2024-10-14 04:29:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 3093 states have (on average 1.7814419657290657) internal successors, (5510), 3099 states have internal predecessors, (5510), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-14 04:29:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5693 transitions. [2024-10-14 04:29:20,599 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5693 transitions. Word has length 111 [2024-10-14 04:29:20,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:29:20,600 INFO L471 AbstractCegarLoop]: Abstraction has 3214 states and 5693 transitions. [2024-10-14 04:29:20,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5693 transitions. [2024-10-14 04:29:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:29:20,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:29:20,602 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] [2024-10-14 04:29:20,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 04:29:20,602 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:29:20,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:29:20,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1889027913, now seen corresponding path program 1 times [2024-10-14 04:29:20,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:29:20,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262013259] [2024-10-14 04:29:20,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:29:20,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:29:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:20,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:29:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:20,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:29:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:20,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:29:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:20,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:29:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:20,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:29:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:20,797 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-14 04:29:20,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:29:20,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262013259] [2024-10-14 04:29:20,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262013259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:29:20,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:29:20,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:29:20,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343922596] [2024-10-14 04:29:20,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:29:20,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:29:20,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:29:20,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:29:20,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:29:20,799 INFO L87 Difference]: Start difference. First operand 3214 states and 5693 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:21,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:29:21,806 INFO L93 Difference]: Finished difference Result 4707 states and 8137 transitions. [2024-10-14 04:29:21,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:29:21,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-14 04:29:21,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:29:21,825 INFO L225 Difference]: With dead ends: 4707 [2024-10-14 04:29:21,826 INFO L226 Difference]: Without dead ends: 3627 [2024-10-14 04:29:21,831 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-14 04:29:21,832 INFO L432 NwaCegarLoop]: 4124 mSDtfsCounter, 4740 mSDsluCounter, 12269 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4755 SdHoareTripleChecker+Valid, 16393 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 04:29:21,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4755 Valid, 16393 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 04:29:21,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3627 states. [2024-10-14 04:29:21,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3627 to 3214. [2024-10-14 04:29:21,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 3093 states have (on average 1.7798254122211445) internal successors, (5505), 3099 states have internal predecessors, (5505), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-14 04:29:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5688 transitions. [2024-10-14 04:29:21,949 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5688 transitions. Word has length 111 [2024-10-14 04:29:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:29:21,949 INFO L471 AbstractCegarLoop]: Abstraction has 3214 states and 5688 transitions. [2024-10-14 04:29:21,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5688 transitions. [2024-10-14 04:29:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:29:21,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:29:21,951 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] [2024-10-14 04:29:21,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 04:29:21,952 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:29:21,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:29:21,952 INFO L85 PathProgramCache]: Analyzing trace with hash 465357369, now seen corresponding path program 1 times [2024-10-14 04:29:21,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:29:21,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204288026] [2024-10-14 04:29:21,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:29:21,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:29:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:22,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:29:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:22,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:29:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:22,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:29:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:22,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:29:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:22,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:29:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:22,137 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-14 04:29:22,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:29:22,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204288026] [2024-10-14 04:29:22,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204288026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:29:22,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:29:22,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:29:22,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998906503] [2024-10-14 04:29:22,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:29:22,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:29:22,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:29:22,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:29:22,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:29:22,145 INFO L87 Difference]: Start difference. First operand 3214 states and 5688 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:29:23,195 INFO L93 Difference]: Finished difference Result 4700 states and 8109 transitions. [2024-10-14 04:29:23,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:29:23,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-14 04:29:23,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:29:23,215 INFO L225 Difference]: With dead ends: 4700 [2024-10-14 04:29:23,216 INFO L226 Difference]: Without dead ends: 3620 [2024-10-14 04:29:23,221 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-14 04:29:23,222 INFO L432 NwaCegarLoop]: 4124 mSDtfsCounter, 4646 mSDsluCounter, 16334 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4661 SdHoareTripleChecker+Valid, 20458 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 04:29:23,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4661 Valid, 20458 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 04:29:23,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3620 states. [2024-10-14 04:29:23,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3620 to 3214. [2024-10-14 04:29:23,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 3093 states have (on average 1.7782088587132234) internal successors, (5500), 3099 states have internal predecessors, (5500), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-14 04:29:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5683 transitions. [2024-10-14 04:29:23,336 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5683 transitions. Word has length 111 [2024-10-14 04:29:23,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:29:23,336 INFO L471 AbstractCegarLoop]: Abstraction has 3214 states and 5683 transitions. [2024-10-14 04:29:23,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:23,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5683 transitions. [2024-10-14 04:29:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:29:23,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:29:23,338 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] [2024-10-14 04:29:23,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 04:29:23,339 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:29:23,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:29:23,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1952546697, now seen corresponding path program 1 times [2024-10-14 04:29:23,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:29:23,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459150963] [2024-10-14 04:29:23,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:29:23,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:29:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:23,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:29:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:23,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:29:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:23,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:29:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:23,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:29:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:23,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:29:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:23,517 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-14 04:29:23,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:29:23,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459150963] [2024-10-14 04:29:23,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459150963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:29:23,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:29:23,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:29:23,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953673893] [2024-10-14 04:29:23,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:29:23,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:29:23,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:29:23,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:29:23,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:29:23,519 INFO L87 Difference]: Start difference. First operand 3214 states and 5683 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:29:24,602 INFO L93 Difference]: Finished difference Result 4688 states and 8071 transitions. [2024-10-14 04:29:24,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:29:24,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-14 04:29:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:29:24,629 INFO L225 Difference]: With dead ends: 4688 [2024-10-14 04:29:24,629 INFO L226 Difference]: Without dead ends: 3608 [2024-10-14 04:29:24,639 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-14 04:29:24,641 INFO L432 NwaCegarLoop]: 4124 mSDtfsCounter, 4643 mSDsluCounter, 16334 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4658 SdHoareTripleChecker+Valid, 20458 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 04:29:24,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4658 Valid, 20458 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 04:29:24,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3608 states. [2024-10-14 04:29:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3608 to 3214. [2024-10-14 04:29:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 3093 states have (on average 1.7765923052053023) internal successors, (5495), 3099 states have internal predecessors, (5495), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-14 04:29:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5678 transitions. [2024-10-14 04:29:24,765 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5678 transitions. Word has length 111 [2024-10-14 04:29:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:29:24,770 INFO L471 AbstractCegarLoop]: Abstraction has 3214 states and 5678 transitions. [2024-10-14 04:29:24,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:24,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5678 transitions. [2024-10-14 04:29:24,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:29:24,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:29:24,772 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] [2024-10-14 04:29:24,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 04:29:24,773 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:29:24,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:29:24,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1347726901, now seen corresponding path program 1 times [2024-10-14 04:29:24,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:29:24,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850591495] [2024-10-14 04:29:24,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:29:24,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:29:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:24,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:29:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:24,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:29:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:24,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:29:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:24,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:29:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:24,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:29:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:24,983 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-14 04:29:24,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:29:24,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850591495] [2024-10-14 04:29:24,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850591495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:29:24,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:29:24,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:29:24,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029118443] [2024-10-14 04:29:24,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:29:24,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:29:24,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:29:24,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:29:24,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:29:24,987 INFO L87 Difference]: Start difference. First operand 3214 states and 5678 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:27,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:29:27,670 INFO L93 Difference]: Finished difference Result 6166 states and 10402 transitions. [2024-10-14 04:29:27,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:29:27,670 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-14 04:29:27,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:29:27,690 INFO L225 Difference]: With dead ends: 6166 [2024-10-14 04:29:27,690 INFO L226 Difference]: Without dead ends: 5086 [2024-10-14 04:29:27,697 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-14 04:29:27,699 INFO L432 NwaCegarLoop]: 4266 mSDtfsCounter, 5132 mSDsluCounter, 16831 mSDsCounter, 0 mSdLazyCounter, 2229 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5154 SdHoareTripleChecker+Valid, 21097 SdHoareTripleChecker+Invalid, 2285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 04:29:27,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5154 Valid, 21097 Invalid, 2285 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 2229 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 04:29:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5086 states. [2024-10-14 04:29:27,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5086 to 4075. [2024-10-14 04:29:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4075 states, 3866 states have (on average 1.734092084842214) internal successors, (6704), 3876 states have internal predecessors, (6704), 145 states have call successors, (145), 54 states have call predecessors, (145), 62 states have return successors, (180), 152 states have call predecessors, (180), 145 states have call successors, (180) [2024-10-14 04:29:27,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4075 states to 4075 states and 7029 transitions. [2024-10-14 04:29:27,962 INFO L78 Accepts]: Start accepts. Automaton has 4075 states and 7029 transitions. Word has length 111 [2024-10-14 04:29:27,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:29:27,962 INFO L471 AbstractCegarLoop]: Abstraction has 4075 states and 7029 transitions. [2024-10-14 04:29:27,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:27,963 INFO L276 IsEmpty]: Start isEmpty. Operand 4075 states and 7029 transitions. [2024-10-14 04:29:27,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:29:27,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:29:27,966 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] [2024-10-14 04:29:27,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 04:29:27,966 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:29:27,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:29:27,967 INFO L85 PathProgramCache]: Analyzing trace with hash 761450679, now seen corresponding path program 1 times [2024-10-14 04:29:27,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:29:27,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005945444] [2024-10-14 04:29:27,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:29:27,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:29:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:28,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:29:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:28,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:29:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:28,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:29:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:28,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:29:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:28,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:29:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:28,191 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-14 04:29:28,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:29:28,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005945444] [2024-10-14 04:29:28,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005945444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:29:28,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:29:28,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:29:28,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2563191] [2024-10-14 04:29:28,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:29:28,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:29:28,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:29:28,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:29:28,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:29:28,194 INFO L87 Difference]: Start difference. First operand 4075 states and 7029 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:30,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:29:30,926 INFO L93 Difference]: Finished difference Result 9483 states and 15673 transitions. [2024-10-14 04:29:30,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:29:30,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-14 04:29:30,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:29:30,955 INFO L225 Difference]: With dead ends: 9483 [2024-10-14 04:29:30,955 INFO L226 Difference]: Without dead ends: 7542 [2024-10-14 04:29:30,965 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-14 04:29:30,966 INFO L432 NwaCegarLoop]: 4265 mSDtfsCounter, 4927 mSDsluCounter, 16828 mSDsCounter, 0 mSdLazyCounter, 2612 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4940 SdHoareTripleChecker+Valid, 21093 SdHoareTripleChecker+Invalid, 2667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 04:29:30,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4940 Valid, 21093 Invalid, 2667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2612 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 04:29:30,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7542 states. [2024-10-14 04:29:31,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7542 to 5746. [2024-10-14 04:29:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5746 states, 5365 states have (on average 1.6857409133271202) internal successors, (9044), 5383 states have internal predecessors, (9044), 261 states have call successors, (261), 102 states have call predecessors, (261), 118 states have return successors, (358), 276 states have call predecessors, (358), 261 states have call successors, (358) [2024-10-14 04:29:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5746 states to 5746 states and 9663 transitions. [2024-10-14 04:29:31,376 INFO L78 Accepts]: Start accepts. Automaton has 5746 states and 9663 transitions. Word has length 111 [2024-10-14 04:29:31,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:29:31,377 INFO L471 AbstractCegarLoop]: Abstraction has 5746 states and 9663 transitions. [2024-10-14 04:29:31,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:31,377 INFO L276 IsEmpty]: Start isEmpty. Operand 5746 states and 9663 transitions. [2024-10-14 04:29:31,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:29:31,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:29:31,381 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] [2024-10-14 04:29:31,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 04:29:31,381 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:29:31,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:29:31,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1197124107, now seen corresponding path program 1 times [2024-10-14 04:29:31,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:29:31,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393964741] [2024-10-14 04:29:31,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:29:31,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:29:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:31,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:29:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:31,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:29:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:31,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:29:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:31,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:29:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:31,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:29:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:31,565 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-14 04:29:31,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:29:31,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393964741] [2024-10-14 04:29:31,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393964741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:29:31,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:29:31,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:29:31,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515922568] [2024-10-14 04:29:31,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:29:31,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:29:31,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:29:31,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:29:31,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:29:31,568 INFO L87 Difference]: Start difference. First operand 5746 states and 9663 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:33,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:29:33,938 INFO L93 Difference]: Finished difference Result 15876 states and 25869 transitions. [2024-10-14 04:29:33,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:29:33,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-14 04:29:33,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:29:33,992 INFO L225 Difference]: With dead ends: 15876 [2024-10-14 04:29:33,993 INFO L226 Difference]: Without dead ends: 12264 [2024-10-14 04:29:34,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:29:34,013 INFO L432 NwaCegarLoop]: 4266 mSDtfsCounter, 5060 mSDsluCounter, 16831 mSDsCounter, 0 mSdLazyCounter, 2203 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5082 SdHoareTripleChecker+Valid, 21097 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 04:29:34,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5082 Valid, 21097 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2203 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 04:29:34,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12264 states. [2024-10-14 04:29:34,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12264 to 9127. [2024-10-14 04:29:34,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9127 states, 8410 states have (on average 1.641141498216409) internal successors, (13802), 8444 states have internal predecessors, (13802), 485 states have call successors, (485), 198 states have call predecessors, (485), 230 states have return successors, (760), 516 states have call predecessors, (760), 485 states have call successors, (760) [2024-10-14 04:29:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9127 states to 9127 states and 15047 transitions. [2024-10-14 04:29:34,516 INFO L78 Accepts]: Start accepts. Automaton has 9127 states and 15047 transitions. Word has length 111 [2024-10-14 04:29:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:29:34,517 INFO L471 AbstractCegarLoop]: Abstraction has 9127 states and 15047 transitions. [2024-10-14 04:29:34,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:34,517 INFO L276 IsEmpty]: Start isEmpty. Operand 9127 states and 15047 transitions. [2024-10-14 04:29:34,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:29:34,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:29:34,523 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] [2024-10-14 04:29:34,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 04:29:34,524 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:29:34,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:29:34,524 INFO L85 PathProgramCache]: Analyzing trace with hash 679358711, now seen corresponding path program 1 times [2024-10-14 04:29:34,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:29:34,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50301701] [2024-10-14 04:29:34,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:29:34,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:29:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:34,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:29:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:34,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:29:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:34,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:29:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:34,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:29:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:34,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:29:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:34,709 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-14 04:29:34,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:29:34,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50301701] [2024-10-14 04:29:34,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50301701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:29:34,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:29:34,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:29:34,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974398118] [2024-10-14 04:29:34,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:29:34,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:29:34,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:29:34,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:29:34,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:29:34,711 INFO L87 Difference]: Start difference. First operand 9127 states and 15047 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:29:37,804 INFO L93 Difference]: Finished difference Result 28527 states and 46239 transitions. [2024-10-14 04:29:37,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:29:37,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-14 04:29:37,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:29:37,893 INFO L225 Difference]: With dead ends: 28527 [2024-10-14 04:29:37,893 INFO L226 Difference]: Without dead ends: 21534 [2024-10-14 04:29:37,930 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-14 04:29:37,931 INFO L432 NwaCegarLoop]: 4266 mSDtfsCounter, 5024 mSDsluCounter, 16831 mSDsCounter, 0 mSdLazyCounter, 2190 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5046 SdHoareTripleChecker+Valid, 21097 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 04:29:37,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5046 Valid, 21097 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2190 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 04:29:37,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21534 states. [2024-10-14 04:29:38,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21534 to 15888. [2024-10-14 04:29:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15888 states, 14515 states have (on average 1.608542886668963) internal successors, (23348), 14581 states have internal predecessors, (23348), 917 states have call successors, (917), 390 states have call predecessors, (917), 454 states have return successors, (1710), 980 states have call predecessors, (1710), 917 states have call successors, (1710) [2024-10-14 04:29:38,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15888 states to 15888 states and 25975 transitions. [2024-10-14 04:29:38,973 INFO L78 Accepts]: Start accepts. Automaton has 15888 states and 25975 transitions. Word has length 111 [2024-10-14 04:29:38,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:29:38,973 INFO L471 AbstractCegarLoop]: Abstraction has 15888 states and 25975 transitions. [2024-10-14 04:29:38,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:38,974 INFO L276 IsEmpty]: Start isEmpty. Operand 15888 states and 25975 transitions. [2024-10-14 04:29:38,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:29:38,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:29:38,985 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] [2024-10-14 04:29:38,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 04:29:38,985 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:29:38,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:29:38,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1199772235, now seen corresponding path program 1 times [2024-10-14 04:29:38,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:29:38,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730385728] [2024-10-14 04:29:38,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:29:38,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:29:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:39,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:29:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:39,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:29:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:39,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:29:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:39,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:29:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:39,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:29:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:39,170 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-14 04:29:39,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:29:39,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730385728] [2024-10-14 04:29:39,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730385728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:29:39,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:29:39,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:29:39,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656309179] [2024-10-14 04:29:39,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:29:39,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:29:39,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:29:39,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:29:39,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:29:39,173 INFO L87 Difference]: Start difference. First operand 15888 states and 25975 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:29:43,518 INFO L93 Difference]: Finished difference Result 53350 states and 86797 transitions. [2024-10-14 04:29:43,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:29:43,518 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-14 04:29:43,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:29:43,665 INFO L225 Difference]: With dead ends: 53350 [2024-10-14 04:29:43,665 INFO L226 Difference]: Without dead ends: 39596 [2024-10-14 04:29:43,708 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-14 04:29:43,709 INFO L432 NwaCegarLoop]: 4266 mSDtfsCounter, 4898 mSDsluCounter, 16831 mSDsCounter, 0 mSdLazyCounter, 2436 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4911 SdHoareTripleChecker+Valid, 21097 SdHoareTripleChecker+Invalid, 2491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 04:29:43,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4911 Valid, 21097 Invalid, 2491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2436 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 04:29:43,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39596 states. [2024-10-14 04:29:45,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39596 to 29409. [2024-10-14 04:29:45,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29409 states, 26756 states have (on average 1.5885035132306773) internal successors, (42502), 26886 states have internal predecessors, (42502), 1749 states have call successors, (1749), 774 states have call predecessors, (1749), 902 states have return successors, (4064), 1876 states have call predecessors, (4064), 1749 states have call successors, (4064) [2024-10-14 04:29:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29409 states to 29409 states and 48315 transitions. [2024-10-14 04:29:45,845 INFO L78 Accepts]: Start accepts. Automaton has 29409 states and 48315 transitions. Word has length 111 [2024-10-14 04:29:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:29:45,845 INFO L471 AbstractCegarLoop]: Abstraction has 29409 states and 48315 transitions. [2024-10-14 04:29:45,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 29409 states and 48315 transitions. [2024-10-14 04:29:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:29:45,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:29:45,869 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] [2024-10-14 04:29:45,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 04:29:45,869 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:29:45,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:29:45,870 INFO L85 PathProgramCache]: Analyzing trace with hash 125083959, now seen corresponding path program 1 times [2024-10-14 04:29:45,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:29:45,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075990664] [2024-10-14 04:29:45,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:29:45,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:29:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:45,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:29:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:45,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:29:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:46,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:29:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:46,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:29:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:46,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:29:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:46,048 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-14 04:29:46,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:29:46,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075990664] [2024-10-14 04:29:46,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075990664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:29:46,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:29:46,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:29:46,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539052292] [2024-10-14 04:29:46,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:29:46,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:29:46,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:29:46,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:29:46,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:29:46,050 INFO L87 Difference]: Start difference. First operand 29409 states and 48315 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:52,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:29:52,284 INFO L93 Difference]: Finished difference Result 102037 states and 168195 transitions. [2024-10-14 04:29:52,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:29:52,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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 111 [2024-10-14 04:29:52,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:29:52,611 INFO L225 Difference]: With dead ends: 102037 [2024-10-14 04:29:52,612 INFO L226 Difference]: Without dead ends: 74762 [2024-10-14 04:29:52,705 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-14 04:29:52,706 INFO L432 NwaCegarLoop]: 4266 mSDtfsCounter, 4958 mSDsluCounter, 16831 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4980 SdHoareTripleChecker+Valid, 21097 SdHoareTripleChecker+Invalid, 2215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 04:29:52,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4980 Valid, 21097 Invalid, 2215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 04:29:52,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2024-10-14 04:29:56,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 56450. [2024-10-14 04:29:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56450 states, 51301 states have (on average 1.57766905128555) internal successors, (80936), 51559 states have internal predecessors, (80936), 3349 states have call successors, (3349), 1542 states have call predecessors, (3349), 1798 states have return successors, (10166), 3604 states have call predecessors, (10166), 3349 states have call successors, (10166) [2024-10-14 04:29:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56450 states to 56450 states and 94451 transitions. [2024-10-14 04:29:57,058 INFO L78 Accepts]: Start accepts. Automaton has 56450 states and 94451 transitions. Word has length 111 [2024-10-14 04:29:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:29:57,059 INFO L471 AbstractCegarLoop]: Abstraction has 56450 states and 94451 transitions. [2024-10-14 04:29:57,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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-14 04:29:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 56450 states and 94451 transitions. [2024-10-14 04:29:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 04:29:57,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:29:57,103 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] [2024-10-14 04:29:57,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 04:29:57,103 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:29:57,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:29:57,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1691841909, now seen corresponding path program 1 times [2024-10-14 04:29:57,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:29:57,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843996677] [2024-10-14 04:29:57,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:29:57,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:29:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:57,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:29:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:57,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 04:29:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:57,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 04:29:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:57,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 04:29:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:57,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 04:29:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:29:57,284 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-14 04:29:57,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:29:57,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843996677] [2024-10-14 04:29:57,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843996677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:29:57,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:29:57,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:29:57,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165634004] [2024-10-14 04:29:57,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:29:57,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:29:57,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:29:57,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:29:57,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:29:57,287 INFO L87 Difference]: Start difference. First operand 56450 states and 94451 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 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)