./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_label41+token_ring.13.cil-2.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_label41+token_ring.13.cil-2.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 6167950643e67727b303c7b99fc0839aa2067301d926538b67f3f160c480440e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:21:54,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:21:54,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 04:21:54,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:21:54,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:21:54,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:21:54,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:21:54,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:21:54,516 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:21:54,517 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:21:54,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:21:54,518 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:21:54,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:21:54,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:21:54,521 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:21:54,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:21:54,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:21:54,522 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:21:54,522 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 04:21:54,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:21:54,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:21:54,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:21:54,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:21:54,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:21:54,528 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:21:54,528 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:21:54,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:21:54,529 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:21:54,529 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:21:54,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:21:54,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:21:54,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:21:54,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:21:54,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:21:54,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:21:54,531 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:21:54,531 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 04:21:54,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 04:21:54,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:21:54,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:21:54,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:21:54,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:21:54,533 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 -> 6167950643e67727b303c7b99fc0839aa2067301d926538b67f3f160c480440e [2024-10-14 04:21:54,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:21:54,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:21:54,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:21:54,843 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:21:54,843 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:21:54,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.13.cil-2.c [2024-10-14 04:21:56,326 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:21:56,936 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:21:56,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.13.cil-2.c [2024-10-14 04:21:56,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404154be0/1d7e351b3def4023be899a2baefcff80/FLAG38f22d78e [2024-10-14 04:21:57,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404154be0/1d7e351b3def4023be899a2baefcff80 [2024-10-14 04:21:57,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:21:57,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:21:57,021 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:21:57,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:21:57,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:21:57,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:21:57" (1/1) ... [2024-10-14 04:21:57,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d1d830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:57, skipping insertion in model container [2024-10-14 04:21:57,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:21:57" (1/1) ... [2024-10-14 04:21:57,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:21:58,778 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_label41+token_ring.13.cil-2.c[376251,376264] [2024-10-14 04:21:58,815 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_label41+token_ring.13.cil-2.c[383339,383352] [2024-10-14 04:21:59,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:21:59,185 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:21:59,949 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_label41+token_ring.13.cil-2.c[376251,376264] [2024-10-14 04:21:59,960 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_label41+token_ring.13.cil-2.c[383339,383352] [2024-10-14 04:21:59,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:22:00,053 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:22:00,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:00 WrapperNode [2024-10-14 04:22:00,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:22:00,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:22:00,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:22:00,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:22:00,063 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:22:00" (1/1) ... [2024-10-14 04:22:00,184 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:22:00" (1/1) ... [2024-10-14 04:22:00,511 INFO L138 Inliner]: procedures = 70, calls = 80, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 13293 [2024-10-14 04:22:00,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:22:00,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:22:00,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:22:00,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:22:00,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:00" (1/1) ... [2024-10-14 04:22:00,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:00" (1/1) ... [2024-10-14 04:22:00,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:00" (1/1) ... [2024-10-14 04:22:00,890 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:22:00,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:00" (1/1) ... [2024-10-14 04:22:00,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:00" (1/1) ... [2024-10-14 04:22:01,056 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:00" (1/1) ... [2024-10-14 04:22:01,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:00" (1/1) ... [2024-10-14 04:22:01,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:00" (1/1) ... [2024-10-14 04:22:01,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:00" (1/1) ... [2024-10-14 04:22:01,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:22:01,334 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:22:01,334 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:22:01,334 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:22:01,336 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:00" (1/1) ... [2024-10-14 04:22:01,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:22:01,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:22:01,386 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:22:01,399 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:22:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:22:01,453 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 04:22:01,454 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 04:22:01,454 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 04:22:01,455 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 04:22:01,455 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 04:22:01,456 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 04:22:01,456 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 04:22:01,456 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 04:22:01,456 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 04:22:01,456 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 04:22:01,456 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 04:22:01,456 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 04:22:01,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 04:22:01,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:22:01,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:22:01,653 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:22:01,662 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:22:10,013 INFO L? ?]: Removed 1761 outVars from TransFormulas that were not future-live. [2024-10-14 04:22:10,014 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:22:10,210 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:22:10,210 INFO L314 CfgBuilder]: Removed 17 assume(true) statements. [2024-10-14 04:22:10,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:22:10 BoogieIcfgContainer [2024-10-14 04:22:10,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:22:10,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:22:10,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:22:10,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:22:10,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:21:57" (1/3) ... [2024-10-14 04:22:10,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b76ecc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:22:10, skipping insertion in model container [2024-10-14 04:22:10,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:00" (2/3) ... [2024-10-14 04:22:10,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b76ecc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:22:10, skipping insertion in model container [2024-10-14 04:22:10,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:22:10" (3/3) ... [2024-10-14 04:22:10,224 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label41+token_ring.13.cil-2.c [2024-10-14 04:22:10,244 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:22:10,244 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 04:22:10,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:22:10,394 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;@28e7e6ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:22:10,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 04:22:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 2494 states, 2458 states have (on average 1.8746948738812041) internal successors, (4608), 2461 states have internal predecessors, (4608), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 04:22:10,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:22:10,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:10,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:10,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:10,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:10,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1072822453, now seen corresponding path program 1 times [2024-10-14 04:22:10,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:10,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350605629] [2024-10-14 04:22:10,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:10,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:10,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:11,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:22:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:11,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:22:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:11,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:22:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:11,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:22:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:11,210 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:22:11,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:11,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350605629] [2024-10-14 04:22:11,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350605629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:11,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:11,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 04:22:11,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912746861] [2024-10-14 04:22:11,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:11,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:22:11,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:11,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:22:11,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:22:11,258 INFO L87 Difference]: Start difference. First operand has 2494 states, 2458 states have (on average 1.8746948738812041) internal successors, (4608), 2461 states have internal predecessors, (4608), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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:22:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:13,834 INFO L93 Difference]: Finished difference Result 5122 states and 9562 transitions. [2024-10-14 04:22:13,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:22:13,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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 171 [2024-10-14 04:22:13,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:13,873 INFO L225 Difference]: With dead ends: 5122 [2024-10-14 04:22:13,874 INFO L226 Difference]: Without dead ends: 2630 [2024-10-14 04:22:13,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 04:22:13,890 INFO L432 NwaCegarLoop]: 4276 mSDtfsCounter, 1048 mSDsluCounter, 12226 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 16502 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:13,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 16502 Invalid, 1206 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 04:22:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2024-10-14 04:22:14,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2490. [2024-10-14 04:22:14,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2455 states have (on average 1.8354378818737271) internal successors, (4506), 2457 states have internal predecessors, (4506), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 04:22:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 4560 transitions. [2024-10-14 04:22:14,075 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 4560 transitions. Word has length 171 [2024-10-14 04:22:14,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:14,076 INFO L471 AbstractCegarLoop]: Abstraction has 2490 states and 4560 transitions. [2024-10-14 04:22:14,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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:22:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 4560 transitions. [2024-10-14 04:22:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:22:14,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:14,081 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:14,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 04:22:14,082 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:14,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:14,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1643094259, now seen corresponding path program 1 times [2024-10-14 04:22:14,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:14,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594749852] [2024-10-14 04:22:14,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:14,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:14,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:14,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:22:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:14,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:22:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:14,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:22:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:14,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:22:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:14,471 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:22:14,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:14,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594749852] [2024-10-14 04:22:14,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594749852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:14,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:14,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 04:22:14,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085028154] [2024-10-14 04:22:14,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:14,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:22:14,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:14,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:22:14,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:22:14,482 INFO L87 Difference]: Start difference. First operand 2490 states and 4560 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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:22:16,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:16,894 INFO L93 Difference]: Finished difference Result 2984 states and 5386 transitions. [2024-10-14 04:22:16,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:22:16,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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 171 [2024-10-14 04:22:16,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:16,913 INFO L225 Difference]: With dead ends: 2984 [2024-10-14 04:22:16,914 INFO L226 Difference]: Without dead ends: 2630 [2024-10-14 04:22:16,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 04:22:16,918 INFO L432 NwaCegarLoop]: 4272 mSDtfsCounter, 1036 mSDsluCounter, 12217 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 16489 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:16,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 16489 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 04:22:16,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2024-10-14 04:22:16,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2490. [2024-10-14 04:22:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2490 states, 2455 states have (on average 1.835030549898167) internal successors, (4505), 2457 states have internal predecessors, (4505), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 04:22:16,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2490 states and 4559 transitions. [2024-10-14 04:22:16,998 INFO L78 Accepts]: Start accepts. Automaton has 2490 states and 4559 transitions. Word has length 171 [2024-10-14 04:22:16,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:16,999 INFO L471 AbstractCegarLoop]: Abstraction has 2490 states and 4559 transitions. [2024-10-14 04:22:16,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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:22:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2490 states and 4559 transitions. [2024-10-14 04:22:17,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:22:17,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:17,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:17,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 04:22:17,002 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:17,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:17,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1031825201, now seen corresponding path program 1 times [2024-10-14 04:22:17,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:17,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036433432] [2024-10-14 04:22:17,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:17,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:17,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:17,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:22:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:17,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:22:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:17,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:22:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:17,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:22:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:17,389 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:22:17,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:17,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036433432] [2024-10-14 04:22:17,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036433432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:17,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:17,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:22:17,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007853491] [2024-10-14 04:22:17,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:17,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:22:17,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:17,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:22:17,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:22:17,396 INFO L87 Difference]: Start difference. First operand 2490 states and 4559 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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:22:20,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:20,899 INFO L93 Difference]: Finished difference Result 3491 states and 6239 transitions. [2024-10-14 04:22:20,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 04:22:20,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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 171 [2024-10-14 04:22:20,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:20,914 INFO L225 Difference]: With dead ends: 3491 [2024-10-14 04:22:20,915 INFO L226 Difference]: Without dead ends: 3141 [2024-10-14 04:22:20,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:22:20,921 INFO L432 NwaCegarLoop]: 4238 mSDtfsCounter, 5542 mSDsluCounter, 12708 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5562 SdHoareTripleChecker+Valid, 16946 SdHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:20,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5562 Valid, 16946 Invalid, 2578 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [112 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 04:22:20,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2024-10-14 04:22:21,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 2862. [2024-10-14 04:22:21,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2862 states, 2798 states have (on average 1.812723373838456) internal successors, (5072), 2801 states have internal predecessors, (5072), 49 states have call successors, (49), 12 states have call predecessors, (49), 13 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2024-10-14 04:22:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 5173 transitions. [2024-10-14 04:22:21,031 INFO L78 Accepts]: Start accepts. Automaton has 2862 states and 5173 transitions. Word has length 171 [2024-10-14 04:22:21,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:21,032 INFO L471 AbstractCegarLoop]: Abstraction has 2862 states and 5173 transitions. [2024-10-14 04:22:21,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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:22:21,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2862 states and 5173 transitions. [2024-10-14 04:22:21,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:22:21,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:21,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:21,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 04:22:21,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:21,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:21,037 INFO L85 PathProgramCache]: Analyzing trace with hash 247523539, now seen corresponding path program 1 times [2024-10-14 04:22:21,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:21,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669574866] [2024-10-14 04:22:21,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:21,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:21,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:21,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:22:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:21,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:22:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:21,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:22:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:21,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:22:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:21,469 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:22:21,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:21,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669574866] [2024-10-14 04:22:21,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669574866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:21,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:21,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:21,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672057875] [2024-10-14 04:22:21,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:21,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:21,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:21,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:21,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:21,473 INFO L87 Difference]: Start difference. First operand 2862 states and 5173 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:22:26,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:26,009 INFO L93 Difference]: Finished difference Result 4396 states and 7749 transitions. [2024-10-14 04:22:26,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:22:26,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-14 04:22:26,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:26,030 INFO L225 Difference]: With dead ends: 4396 [2024-10-14 04:22:26,031 INFO L226 Difference]: Without dead ends: 3674 [2024-10-14 04:22:26,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:22:26,039 INFO L432 NwaCegarLoop]: 4449 mSDtfsCounter, 5591 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 3997 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5611 SdHoareTripleChecker+Valid, 21912 SdHoareTripleChecker+Invalid, 4060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:26,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5611 Valid, 21912 Invalid, 4060 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3997 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-14 04:22:26,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2024-10-14 04:22:26,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3205. [2024-10-14 04:22:26,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3112 states have (on average 1.7933804627249357) internal successors, (5581), 3116 states have internal predecessors, (5581), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-14 04:22:26,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5728 transitions. [2024-10-14 04:22:26,215 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5728 transitions. Word has length 171 [2024-10-14 04:22:26,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:26,216 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5728 transitions. [2024-10-14 04:22:26,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:22:26,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5728 transitions. [2024-10-14 04:22:26,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:22:26,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:26,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:26,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 04:22:26,220 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:26,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:26,221 INFO L85 PathProgramCache]: Analyzing trace with hash -17123951, now seen corresponding path program 1 times [2024-10-14 04:22:26,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:26,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276282893] [2024-10-14 04:22:26,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:26,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:26,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:26,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:22:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:26,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:22:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:26,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:22:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:26,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:22:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:26,633 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:22:26,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:26,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276282893] [2024-10-14 04:22:26,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276282893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:26,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:26,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:26,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121743186] [2024-10-14 04:22:26,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:26,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:26,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:26,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:26,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:26,642 INFO L87 Difference]: Start difference. First operand 3205 states and 5728 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:22:29,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:29,004 INFO L93 Difference]: Finished difference Result 4759 states and 8350 transitions. [2024-10-14 04:22:29,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:22:29,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-14 04:22:29,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:29,020 INFO L225 Difference]: With dead ends: 4759 [2024-10-14 04:22:29,021 INFO L226 Difference]: Without dead ends: 3694 [2024-10-14 04:22:29,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:22:29,025 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5115 mSDsluCounter, 16655 mSDsCounter, 0 mSdLazyCounter, 2047 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5136 SdHoareTripleChecker+Valid, 20880 SdHoareTripleChecker+Invalid, 2114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:29,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5136 Valid, 20880 Invalid, 2114 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 2047 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 04:22:29,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2024-10-14 04:22:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3205. [2024-10-14 04:22:29,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3112 states have (on average 1.7924164524421593) internal successors, (5578), 3116 states have internal predecessors, (5578), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-14 04:22:29,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5725 transitions. [2024-10-14 04:22:29,146 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5725 transitions. Word has length 171 [2024-10-14 04:22:29,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:29,146 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5725 transitions. [2024-10-14 04:22:29,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:22:29,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5725 transitions. [2024-10-14 04:22:29,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:22:29,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:29,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:29,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 04:22:29,150 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:29,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:29,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1340302897, now seen corresponding path program 1 times [2024-10-14 04:22:29,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:29,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809484369] [2024-10-14 04:22:29,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:29,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:29,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:29,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:22:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:29,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:22:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:29,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:22:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:29,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:22:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:29,456 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:22:29,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:29,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809484369] [2024-10-14 04:22:29,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809484369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:29,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:29,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:29,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986590749] [2024-10-14 04:22:29,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:29,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:29,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:29,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:29,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:29,459 INFO L87 Difference]: Start difference. First operand 3205 states and 5725 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:22:31,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:31,258 INFO L93 Difference]: Finished difference Result 4755 states and 8333 transitions. [2024-10-14 04:22:31,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:22:31,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-14 04:22:31,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:31,276 INFO L225 Difference]: With dead ends: 4755 [2024-10-14 04:22:31,276 INFO L226 Difference]: Without dead ends: 3690 [2024-10-14 04:22:31,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:22:31,284 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5276 mSDsluCounter, 12525 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5297 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:31,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5297 Valid, 16750 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 04:22:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2024-10-14 04:22:31,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3205. [2024-10-14 04:22:31,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3112 states have (on average 1.791452442159383) internal successors, (5575), 3116 states have internal predecessors, (5575), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-14 04:22:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5722 transitions. [2024-10-14 04:22:31,467 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5722 transitions. Word has length 171 [2024-10-14 04:22:31,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:31,468 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5722 transitions. [2024-10-14 04:22:31,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:22:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5722 transitions. [2024-10-14 04:22:31,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:22:31,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:31,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:31,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 04:22:31,472 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:31,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:31,473 INFO L85 PathProgramCache]: Analyzing trace with hash 556676561, now seen corresponding path program 1 times [2024-10-14 04:22:31,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:31,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036063263] [2024-10-14 04:22:31,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:31,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:31,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:31,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:22:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:31,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:22:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:31,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:22:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:31,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:22:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:31,851 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:22:31,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:31,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036063263] [2024-10-14 04:22:31,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036063263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:31,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:31,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:31,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457046545] [2024-10-14 04:22:31,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:31,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:31,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:31,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:31,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:31,853 INFO L87 Difference]: Start difference. First operand 3205 states and 5722 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:22:33,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:33,589 INFO L93 Difference]: Finished difference Result 4751 states and 8316 transitions. [2024-10-14 04:22:33,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:22:33,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-14 04:22:33,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:33,610 INFO L225 Difference]: With dead ends: 4751 [2024-10-14 04:22:33,614 INFO L226 Difference]: Without dead ends: 3686 [2024-10-14 04:22:33,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:22:33,623 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5274 mSDsluCounter, 12525 mSDsCounter, 0 mSdLazyCounter, 1819 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5295 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:33,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5295 Valid, 16750 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1819 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 04:22:33,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2024-10-14 04:22:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3205. [2024-10-14 04:22:33,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 3112 states have (on average 1.7904884318766068) internal successors, (5572), 3116 states have internal predecessors, (5572), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-14 04:22:33,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5719 transitions. [2024-10-14 04:22:33,762 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5719 transitions. Word has length 171 [2024-10-14 04:22:33,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:33,762 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5719 transitions. [2024-10-14 04:22:33,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:22:33,767 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5719 transitions. [2024-10-14 04:22:33,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:22:33,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:33,770 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:33,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 04:22:33,770 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:33,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:33,771 INFO L85 PathProgramCache]: Analyzing trace with hash 894964111, now seen corresponding path program 1 times [2024-10-14 04:22:33,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:33,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670943589] [2024-10-14 04:22:33,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:33,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:33,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:33,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:22:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:34,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:22:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:34,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:22:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:34,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:22:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:34,077 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:22:34,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:34,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670943589] [2024-10-14 04:22:34,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670943589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:34,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:34,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:34,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012942934] [2024-10-14 04:22:34,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:34,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:34,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:34,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:34,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:34,081 INFO L87 Difference]: Start difference. First operand 3205 states and 5719 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:22:37,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:37,858 INFO L93 Difference]: Finished difference Result 5709 states and 9880 transitions. [2024-10-14 04:22:37,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:22:37,859 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-14 04:22:37,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:37,878 INFO L225 Difference]: With dead ends: 5709 [2024-10-14 04:22:37,879 INFO L226 Difference]: Without dead ends: 4644 [2024-10-14 04:22:37,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:22:37,886 INFO L432 NwaCegarLoop]: 4247 mSDtfsCounter, 5674 mSDsluCounter, 16920 mSDsCounter, 0 mSdLazyCounter, 3255 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5694 SdHoareTripleChecker+Valid, 21167 SdHoareTripleChecker+Invalid, 3358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:37,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5694 Valid, 21167 Invalid, 3358 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [103 Valid, 3255 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 04:22:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4644 states. [2024-10-14 04:22:38,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4644 to 3904. [2024-10-14 04:22:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3904 states, 3753 states have (on average 1.7593924860111911) internal successors, (6603), 3759 states have internal predecessors, (6603), 115 states have call successors, (115), 30 states have call predecessors, (115), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-14 04:22:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3904 states to 3904 states and 6846 transitions. [2024-10-14 04:22:38,054 INFO L78 Accepts]: Start accepts. Automaton has 3904 states and 6846 transitions. Word has length 171 [2024-10-14 04:22:38,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:38,056 INFO L471 AbstractCegarLoop]: Abstraction has 3904 states and 6846 transitions. [2024-10-14 04:22:38,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:22:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 6846 transitions. [2024-10-14 04:22:38,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:22:38,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:38,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:38,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 04:22:38,060 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:38,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:38,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1321518609, now seen corresponding path program 1 times [2024-10-14 04:22:38,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:38,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236722143] [2024-10-14 04:22:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:38,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:38,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:38,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:22:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:38,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:22:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:38,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:22:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:38,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:22:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:38,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:22:38,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:38,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236722143] [2024-10-14 04:22:38,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236722143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:38,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:38,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:38,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029036460] [2024-10-14 04:22:38,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:38,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:38,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:38,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:38,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:38,375 INFO L87 Difference]: Start difference. First operand 3904 states and 6846 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:22:40,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:40,202 INFO L93 Difference]: Finished difference Result 6395 states and 10995 transitions. [2024-10-14 04:22:40,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:22:40,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-14 04:22:40,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:40,219 INFO L225 Difference]: With dead ends: 6395 [2024-10-14 04:22:40,219 INFO L226 Difference]: Without dead ends: 4631 [2024-10-14 04:22:40,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:22:40,229 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5273 mSDsluCounter, 12525 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5294 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:40,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5294 Valid, 16750 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 04:22:40,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2024-10-14 04:22:40,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 3904. [2024-10-14 04:22:40,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3904 states, 3753 states have (on average 1.7580602184918732) internal successors, (6598), 3759 states have internal predecessors, (6598), 115 states have call successors, (115), 30 states have call predecessors, (115), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-14 04:22:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3904 states to 3904 states and 6841 transitions. [2024-10-14 04:22:40,396 INFO L78 Accepts]: Start accepts. Automaton has 3904 states and 6841 transitions. Word has length 171 [2024-10-14 04:22:40,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:40,396 INFO L471 AbstractCegarLoop]: Abstraction has 3904 states and 6841 transitions. [2024-10-14 04:22:40,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:22:40,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3904 states and 6841 transitions. [2024-10-14 04:22:40,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:22:40,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:40,400 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:40,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 04:22:40,401 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:40,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:40,401 INFO L85 PathProgramCache]: Analyzing trace with hash 781089103, now seen corresponding path program 1 times [2024-10-14 04:22:40,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:40,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723937534] [2024-10-14 04:22:40,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:40,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:40,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:40,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:22:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:40,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:22:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:40,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:22:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:40,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:22:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:40,717 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:22:40,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:40,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723937534] [2024-10-14 04:22:40,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723937534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:40,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:40,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:40,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898058994] [2024-10-14 04:22:40,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:40,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:40,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:40,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:40,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:40,720 INFO L87 Difference]: Start difference. First operand 3904 states and 6841 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:22:44,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:44,641 INFO L93 Difference]: Finished difference Result 8250 states and 14007 transitions. [2024-10-14 04:22:44,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:22:44,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-14 04:22:44,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:44,666 INFO L225 Difference]: With dead ends: 8250 [2024-10-14 04:22:44,666 INFO L226 Difference]: Without dead ends: 6486 [2024-10-14 04:22:44,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:22:44,676 INFO L432 NwaCegarLoop]: 4447 mSDtfsCounter, 5556 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 3863 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5576 SdHoareTripleChecker+Valid, 21910 SdHoareTripleChecker+Invalid, 3928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:44,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5576 Valid, 21910 Invalid, 3928 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3863 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-14 04:22:44,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6486 states. [2024-10-14 04:22:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6486 to 5302. [2024-10-14 04:22:44,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5302 states, 5035 states have (on average 1.717974180734856) internal successors, (8650), 5045 states have internal predecessors, (8650), 203 states have call successors, (203), 54 states have call predecessors, (203), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-10-14 04:22:44,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5302 states to 5302 states and 9091 transitions. [2024-10-14 04:22:44,932 INFO L78 Accepts]: Start accepts. Automaton has 5302 states and 9091 transitions. Word has length 171 [2024-10-14 04:22:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:44,933 INFO L471 AbstractCegarLoop]: Abstraction has 5302 states and 9091 transitions. [2024-10-14 04:22:44,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:22:44,934 INFO L276 IsEmpty]: Start isEmpty. Operand 5302 states and 9091 transitions. [2024-10-14 04:22:44,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:22:44,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:44,938 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:44,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 04:22:44,938 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:44,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:44,939 INFO L85 PathProgramCache]: Analyzing trace with hash 625108561, now seen corresponding path program 1 times [2024-10-14 04:22:44,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:44,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742529118] [2024-10-14 04:22:44,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:44,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:45,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:45,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:22:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:45,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:22:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:45,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:22:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:45,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:22:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:45,247 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:22:45,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:45,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742529118] [2024-10-14 04:22:45,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742529118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:45,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:45,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:45,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228020651] [2024-10-14 04:22:45,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:45,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:45,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:45,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:45,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:45,249 INFO L87 Difference]: Start difference. First operand 5302 states and 9091 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:22:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:49,680 INFO L93 Difference]: Finished difference Result 13338 states and 22315 transitions. [2024-10-14 04:22:49,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:22:49,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-14 04:22:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:49,720 INFO L225 Difference]: With dead ends: 13338 [2024-10-14 04:22:49,721 INFO L226 Difference]: Without dead ends: 10176 [2024-10-14 04:22:49,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:22:49,739 INFO L432 NwaCegarLoop]: 4447 mSDtfsCounter, 5561 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 3845 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5581 SdHoareTripleChecker+Valid, 21910 SdHoareTripleChecker+Invalid, 3910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:49,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5581 Valid, 21910 Invalid, 3910 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3845 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-14 04:22:49,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10176 states. [2024-10-14 04:22:50,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10176 to 8103. [2024-10-14 04:22:50,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8103 states, 7604 states have (on average 1.6780641767490794) internal successors, (12760), 7622 states have internal predecessors, (12760), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-14 04:22:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 13615 transitions. [2024-10-14 04:22:50,206 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 13615 transitions. Word has length 171 [2024-10-14 04:22:50,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:50,207 INFO L471 AbstractCegarLoop]: Abstraction has 8103 states and 13615 transitions. [2024-10-14 04:22:50,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:22:50,208 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 13615 transitions. [2024-10-14 04:22:50,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:22:50,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:50,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:50,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 04:22:50,214 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:50,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:50,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1035718927, now seen corresponding path program 1 times [2024-10-14 04:22:50,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:50,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616550875] [2024-10-14 04:22:50,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:50,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:50,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:50,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:22:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:50,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:22:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:50,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:22:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:50,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:22:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:50,475 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:22:50,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:50,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616550875] [2024-10-14 04:22:50,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616550875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:50,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:50,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:50,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652398256] [2024-10-14 04:22:50,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:50,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:50,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:50,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:50,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:50,477 INFO L87 Difference]: Start difference. First operand 8103 states and 13615 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:22:52,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:52,669 INFO L93 Difference]: Finished difference Result 16213 states and 27056 transitions. [2024-10-14 04:22:52,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:22:52,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-14 04:22:52,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:52,704 INFO L225 Difference]: With dead ends: 16213 [2024-10-14 04:22:52,705 INFO L226 Difference]: Without dead ends: 10250 [2024-10-14 04:22:52,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:22:52,728 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5277 mSDsluCounter, 12525 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5298 SdHoareTripleChecker+Valid, 16750 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:52,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5298 Valid, 16750 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 04:22:52,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10250 states. [2024-10-14 04:22:53,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10250 to 8103. [2024-10-14 04:22:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8103 states, 7604 states have (on average 1.675828511309837) internal successors, (12743), 7622 states have internal predecessors, (12743), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-14 04:22:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 13598 transitions. [2024-10-14 04:22:53,181 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 13598 transitions. Word has length 171 [2024-10-14 04:22:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:53,182 INFO L471 AbstractCegarLoop]: Abstraction has 8103 states and 13598 transitions. [2024-10-14 04:22:53,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:22:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 13598 transitions. [2024-10-14 04:22:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:22:53,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:53,188 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:53,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 04:22:53,189 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:53,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:53,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1100164275, now seen corresponding path program 1 times [2024-10-14 04:22:53,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:53,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416076975] [2024-10-14 04:22:53,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:53,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:53,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:53,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:22:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:53,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:22:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:53,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:22:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:53,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:22:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:53,436 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:22:53,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:53,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416076975] [2024-10-14 04:22:53,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416076975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:53,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:53,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:53,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133174853] [2024-10-14 04:22:53,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:53,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:53,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:53,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:53,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:53,439 INFO L87 Difference]: Start difference. First operand 8103 states and 13598 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:22:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:55,728 INFO L93 Difference]: Finished difference Result 16195 states and 26969 transitions. [2024-10-14 04:22:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:22:55,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-14 04:22:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:55,766 INFO L225 Difference]: With dead ends: 16195 [2024-10-14 04:22:55,767 INFO L226 Difference]: Without dead ends: 10232 [2024-10-14 04:22:55,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:22:55,791 INFO L432 NwaCegarLoop]: 4225 mSDtfsCounter, 5112 mSDsluCounter, 16655 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5133 SdHoareTripleChecker+Valid, 20880 SdHoareTripleChecker+Invalid, 1991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:55,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5133 Valid, 20880 Invalid, 1991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 04:22:55,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10232 states. [2024-10-14 04:22:56,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10232 to 8103. [2024-10-14 04:22:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8103 states, 7604 states have (on average 1.6735928458705944) internal successors, (12726), 7622 states have internal predecessors, (12726), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-14 04:22:56,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 13581 transitions. [2024-10-14 04:22:56,261 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 13581 transitions. Word has length 171 [2024-10-14 04:22:56,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:56,262 INFO L471 AbstractCegarLoop]: Abstraction has 8103 states and 13581 transitions. [2024-10-14 04:22:56,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:22:56,263 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 13581 transitions. [2024-10-14 04:22:56,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:22:56,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:56,269 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:56,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 04:22:56,269 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:56,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:56,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1030516401, now seen corresponding path program 1 times [2024-10-14 04:22:56,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:56,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379772251] [2024-10-14 04:22:56,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:56,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:56,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:56,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:22:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:56,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:22:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:56,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:22:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:56,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:22:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:56,541 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:22:56,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:56,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379772251] [2024-10-14 04:22:56,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379772251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:56,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:56,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:56,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910164451] [2024-10-14 04:22:56,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:56,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:56,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:56,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:56,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:56,544 INFO L87 Difference]: Start difference. First operand 8103 states and 13581 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:23:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:23:00,829 INFO L93 Difference]: Finished difference Result 23459 states and 38713 transitions. [2024-10-14 04:23:00,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:23:00,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 171 [2024-10-14 04:23:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:23:00,896 INFO L225 Difference]: With dead ends: 23459 [2024-10-14 04:23:00,897 INFO L226 Difference]: Without dead ends: 17496 [2024-10-14 04:23:00,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:23:00,923 INFO L432 NwaCegarLoop]: 4447 mSDtfsCounter, 5542 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 3768 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5562 SdHoareTripleChecker+Valid, 21910 SdHoareTripleChecker+Invalid, 3833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 04:23:00,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5562 Valid, 21910 Invalid, 3833 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3768 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 04:23:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17496 states. [2024-10-14 04:23:01,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17496 to 13771. [2024-10-14 04:23:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13771 states, 12808 states have (on average 1.6400687070580886) internal successors, (21006), 12842 states have internal predecessors, (21006), 731 states have call successors, (731), 198 states have call predecessors, (731), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-10-14 04:23:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13771 states to 13771 states and 22743 transitions. [2024-10-14 04:23:01,980 INFO L78 Accepts]: Start accepts. Automaton has 13771 states and 22743 transitions. Word has length 171 [2024-10-14 04:23:01,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:23:01,981 INFO L471 AbstractCegarLoop]: Abstraction has 13771 states and 22743 transitions. [2024-10-14 04:23:01,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:23:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 13771 states and 22743 transitions. [2024-10-14 04:23:01,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 04:23:01,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:23:01,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:01,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 04:23:01,994 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:23:01,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:23:01,995 INFO L85 PathProgramCache]: Analyzing trace with hash -612627699, now seen corresponding path program 1 times [2024-10-14 04:23:01,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:23:01,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131583348] [2024-10-14 04:23:01,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:23:01,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:23:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:23:02,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:23:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:23:02,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:23:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:23:02,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:23:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:23:02,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:23:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:23:02,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:23:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:23:02,273 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:23:02,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:23:02,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131583348] [2024-10-14 04:23:02,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131583348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:23:02,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:23:02,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:23:02,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909518169] [2024-10-14 04:23:02,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:23:02,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:23:02,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:23:02,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:23:02,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:23:02,276 INFO L87 Difference]: Start difference. First operand 13771 states and 22743 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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)