./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5738c99ca39a13f327ff059e5a6f3b47670e1701984219677e7b62ff58bbdc65 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:14:11,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:14:11,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:14:11,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:14:11,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:14:11,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:14:11,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:14:11,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:14:11,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:14:11,493 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:14:11,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:14:11,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:14:11,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:14:11,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:14:11,498 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:14:11,498 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:14:11,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:14:11,499 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:14:11,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:14:11,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:14:11,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:14:11,504 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:14:11,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:14:11,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:14:11,505 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:14:11,505 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:14:11,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:14:11,506 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:14:11,506 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:14:11,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:14:11,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:14:11,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:14:11,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:14:11,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:14:11,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:14:11,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:14:11,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:14:11,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:14:11,510 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:14:11,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:14:11,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:14:11,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:14:11,511 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5738c99ca39a13f327ff059e5a6f3b47670e1701984219677e7b62ff58bbdc65 [2024-10-11 04:14:11,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:14:11,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:14:11,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:14:11,804 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:14:11,804 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:14:11,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.cil-2.c [2024-10-11 04:14:13,274 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:14:13,828 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:14:13,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.cil-2.c [2024-10-11 04:14:13,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5c773e62b/c90dde690bb4488cacc0d21f24be3988/FLAGb8a575fbc [2024-10-11 04:14:14,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5c773e62b/c90dde690bb4488cacc0d21f24be3988 [2024-10-11 04:14:14,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:14:14,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:14:14,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:14:14,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:14:14,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:14:14,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:14:14" (1/1) ... [2024-10-11 04:14:14,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b64f6b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:14, skipping insertion in model container [2024-10-11 04:14:14,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:14:14" (1/1) ... [2024-10-11 04:14:14,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:14:16,262 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.cil-2.c[378560,378573] [2024-10-11 04:14:16,296 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.cil-2.c[383339,383352] [2024-10-11 04:14:16,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:14:16,534 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:14:17,347 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.cil-2.c[378560,378573] [2024-10-11 04:14:17,353 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.cil-2.c[383339,383352] [2024-10-11 04:14:17,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:14:17,429 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:14:17,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:17 WrapperNode [2024-10-11 04:14:17,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:14:17,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:14:17,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:14:17,432 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:14:17,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:17" (1/1) ... [2024-10-11 04:14:17,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:17" (1/1) ... [2024-10-11 04:14:18,006 INFO L138 Inliner]: procedures = 58, calls = 63, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 12939 [2024-10-11 04:14:18,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:14:18,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:14:18,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:14:18,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:14:18,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:17" (1/1) ... [2024-10-11 04:14:18,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:17" (1/1) ... [2024-10-11 04:14:18,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:17" (1/1) ... [2024-10-11 04:14:18,260 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 04:14:18,260 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:17" (1/1) ... [2024-10-11 04:14:18,260 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:17" (1/1) ... [2024-10-11 04:14:18,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:17" (1/1) ... [2024-10-11 04:14:18,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:17" (1/1) ... [2024-10-11 04:14:18,540 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:17" (1/1) ... [2024-10-11 04:14:18,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:17" (1/1) ... [2024-10-11 04:14:18,634 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:14:18,636 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:14:18,636 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:14:18,637 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:14:18,638 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:17" (1/1) ... [2024-10-11 04:14:18,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:14:18,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:14:18,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:14:18,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:14:18,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:14:18,722 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:14:18,722 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:14:18,722 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:14:18,724 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:14:18,724 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:14:18,724 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:14:18,724 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 04:14:18,724 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 04:14:18,724 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:14:18,725 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:14:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:14:18,725 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:14:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:14:18,725 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:14:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:14:18,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:14:18,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:14:18,854 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:14:18,856 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:14:27,102 INFO L? ?]: Removed 1729 outVars from TransFormulas that were not future-live. [2024-10-11 04:14:27,102 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:14:27,202 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:14:27,203 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-11 04:14:27,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:14:27 BoogieIcfgContainer [2024-10-11 04:14:27,203 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:14:27,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:14:27,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:14:27,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:14:27,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:14:14" (1/3) ... [2024-10-11 04:14:27,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94e9d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:14:27, skipping insertion in model container [2024-10-11 04:14:27,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:17" (2/3) ... [2024-10-11 04:14:27,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94e9d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:14:27, skipping insertion in model container [2024-10-11 04:14:27,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:14:27" (3/3) ... [2024-10-11 04:14:27,213 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.07.cil-2.c [2024-10-11 04:14:27,229 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:14:27,229 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:14:27,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:14:27,357 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;@73f02815, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:14:27,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:14:27,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 2364 states, 2331 states have (on average 1.8807378807378807) internal successors, (4384), 2336 states have internal predecessors, (4384), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 04:14:27,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:14:27,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:27,394 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] [2024-10-11 04:14:27,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:27,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:27,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1960799786, now seen corresponding path program 1 times [2024-10-11 04:14:27,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:27,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411831353] [2024-10-11 04:14:27,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:27,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:27,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:27,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:14:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:27,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:14:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:27,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:14:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:27,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:14:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:14:27,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:27,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411831353] [2024-10-11 04:14:27,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411831353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:27,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:27,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:14:28,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636574537] [2024-10-11 04:14:28,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:28,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:14:28,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:28,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:14:28,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:14:28,042 INFO L87 Difference]: Start difference. First operand has 2364 states, 2331 states have (on average 1.8807378807378807) internal successors, (4384), 2336 states have internal predecessors, (4384), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:29,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:29,461 INFO L93 Difference]: Finished difference Result 4797 states and 8982 transitions. [2024-10-11 04:14:29,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:14:29,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-10-11 04:14:29,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:29,503 INFO L225 Difference]: With dead ends: 4797 [2024-10-11 04:14:29,504 INFO L226 Difference]: Without dead ends: 2439 [2024-10-11 04:14:29,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:14:29,515 INFO L432 NwaCegarLoop]: 4173 mSDtfsCounter, 632 mSDsluCounter, 12112 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 16285 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:29,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 16285 Invalid, 731 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 04:14:29,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2024-10-11 04:14:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 2359. [2024-10-11 04:14:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2359 states, 2328 states have (on average 1.8445017182130585) internal successors, (4294), 2331 states have internal predecessors, (4294), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 04:14:29,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 4338 transitions. [2024-10-11 04:14:29,677 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 4338 transitions. Word has length 112 [2024-10-11 04:14:29,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:29,677 INFO L471 AbstractCegarLoop]: Abstraction has 2359 states and 4338 transitions. [2024-10-11 04:14:29,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 4338 transitions. [2024-10-11 04:14:29,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:14:29,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:29,685 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] [2024-10-11 04:14:29,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:14:29,685 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:29,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:29,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1303126612, now seen corresponding path program 1 times [2024-10-11 04:14:29,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:29,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114300464] [2024-10-11 04:14:29,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:29,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:29,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:29,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:14:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:29,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:14:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:29,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:14:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:30,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:14:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:14:30,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:30,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114300464] [2024-10-11 04:14:30,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114300464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:30,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:30,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:14:30,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407087674] [2024-10-11 04:14:30,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:30,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:14:30,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:30,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:14:30,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:14:30,028 INFO L87 Difference]: Start difference. First operand 2359 states and 4338 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:31,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:31,962 INFO L93 Difference]: Finished difference Result 2978 states and 5358 transitions. [2024-10-11 04:14:31,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:14:31,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-10-11 04:14:31,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:31,976 INFO L225 Difference]: With dead ends: 2978 [2024-10-11 04:14:31,976 INFO L226 Difference]: Without dead ends: 2753 [2024-10-11 04:14:31,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:14:31,980 INFO L432 NwaCegarLoop]: 4148 mSDtfsCounter, 4905 mSDsluCounter, 12430 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4919 SdHoareTripleChecker+Valid, 16578 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:31,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4919 Valid, 16578 Invalid, 1554 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [96 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:14:31,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2024-10-11 04:14:32,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 2592. [2024-10-11 04:14:32,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2592 states, 2538 states have (on average 1.8270291568163908) internal successors, (4637), 2542 states have internal predecessors, (4637), 39 states have call successors, (39), 13 states have call predecessors, (39), 13 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2024-10-11 04:14:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 4716 transitions. [2024-10-11 04:14:32,068 INFO L78 Accepts]: Start accepts. Automaton has 2592 states and 4716 transitions. Word has length 112 [2024-10-11 04:14:32,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:32,070 INFO L471 AbstractCegarLoop]: Abstraction has 2592 states and 4716 transitions. [2024-10-11 04:14:32,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 4716 transitions. [2024-10-11 04:14:32,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:14:32,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:32,077 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] [2024-10-11 04:14:32,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:14:32,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:32,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:32,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1997587888, now seen corresponding path program 1 times [2024-10-11 04:14:32,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:32,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136517316] [2024-10-11 04:14:32,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:32,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:32,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:32,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:14:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:32,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:14:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:32,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:14:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:32,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:14:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:32,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:14:32,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:32,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136517316] [2024-10-11 04:14:32,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136517316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:32,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:32,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:32,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832937007] [2024-10-11 04:14:32,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:32,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:32,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:32,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:32,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:32,391 INFO L87 Difference]: Start difference. First operand 2592 states and 4716 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:35,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:35,243 INFO L93 Difference]: Finished difference Result 3533 states and 6264 transitions. [2024-10-11 04:14:35,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:14:35,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-10-11 04:14:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:35,262 INFO L225 Difference]: With dead ends: 3533 [2024-10-11 04:14:35,263 INFO L226 Difference]: Without dead ends: 3075 [2024-10-11 04:14:35,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:14:35,267 INFO L432 NwaCegarLoop]: 4292 mSDtfsCounter, 4918 mSDsluCounter, 16919 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4932 SdHoareTripleChecker+Valid, 21211 SdHoareTripleChecker+Invalid, 2443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:35,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4932 Valid, 21211 Invalid, 2443 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [55 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 04:14:35,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2024-10-11 04:14:35,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 2808. [2024-10-11 04:14:35,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2808 states, 2731 states have (on average 1.8110582204320762) internal successors, (4946), 2736 states have internal predecessors, (4946), 55 states have call successors, (55), 19 states have call predecessors, (55), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-10-11 04:14:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 5059 transitions. [2024-10-11 04:14:35,402 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 5059 transitions. Word has length 112 [2024-10-11 04:14:35,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:35,402 INFO L471 AbstractCegarLoop]: Abstraction has 2808 states and 5059 transitions. [2024-10-11 04:14:35,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:35,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 5059 transitions. [2024-10-11 04:14:35,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:14:35,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:35,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:14:35,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:14:35,406 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:35,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:35,407 INFO L85 PathProgramCache]: Analyzing trace with hash -646202670, now seen corresponding path program 1 times [2024-10-11 04:14:35,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:35,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114335077] [2024-10-11 04:14:35,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:35,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:35,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:35,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:14:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:35,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:14:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:35,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:14:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:35,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:14:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:14:35,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:35,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114335077] [2024-10-11 04:14:35,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114335077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:35,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:35,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:35,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572605446] [2024-10-11 04:14:35,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:35,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:35,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:35,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:35,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:35,721 INFO L87 Difference]: Start difference. First operand 2808 states and 5059 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:38,209 INFO L93 Difference]: Finished difference Result 4346 states and 7585 transitions. [2024-10-11 04:14:38,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:14:38,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-10-11 04:14:38,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:38,231 INFO L225 Difference]: With dead ends: 4346 [2024-10-11 04:14:38,232 INFO L226 Difference]: Without dead ends: 3672 [2024-10-11 04:14:38,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:14:38,238 INFO L432 NwaCegarLoop]: 4290 mSDtfsCounter, 4916 mSDsluCounter, 16919 mSDsCounter, 0 mSdLazyCounter, 2384 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4930 SdHoareTripleChecker+Valid, 21209 SdHoareTripleChecker+Invalid, 2441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:38,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4930 Valid, 21209 Invalid, 2441 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 04:14:38,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2024-10-11 04:14:38,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3241. [2024-10-11 04:14:38,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 3118 states have (on average 1.784797947402181) internal successors, (5565), 3125 states have internal predecessors, (5565), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-11 04:14:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5750 transitions. [2024-10-11 04:14:38,491 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5750 transitions. Word has length 112 [2024-10-11 04:14:38,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:38,492 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5750 transitions. [2024-10-11 04:14:38,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:38,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5750 transitions. [2024-10-11 04:14:38,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:14:38,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:38,495 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] [2024-10-11 04:14:38,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:14:38,496 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:38,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:38,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2029789712, now seen corresponding path program 1 times [2024-10-11 04:14:38,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:38,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930157429] [2024-10-11 04:14:38,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:38,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:38,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:38,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:14:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:38,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:14:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:38,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:14:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:38,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:14:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:14:38,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:38,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930157429] [2024-10-11 04:14:38,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930157429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:38,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:38,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:38,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556132860] [2024-10-11 04:14:38,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:38,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:38,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:38,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:38,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:38,726 INFO L87 Difference]: Start difference. First operand 3241 states and 5750 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:39,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:39,854 INFO L93 Difference]: Finished difference Result 4767 states and 8267 transitions. [2024-10-11 04:14:39,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:14:39,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-10-11 04:14:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:39,874 INFO L225 Difference]: With dead ends: 4767 [2024-10-11 04:14:39,874 INFO L226 Difference]: Without dead ends: 3660 [2024-10-11 04:14:39,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:14:39,883 INFO L432 NwaCegarLoop]: 4135 mSDtfsCounter, 4757 mSDsluCounter, 12296 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4772 SdHoareTripleChecker+Valid, 16431 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:39,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4772 Valid, 16431 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:14:39,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2024-10-11 04:14:40,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3241. [2024-10-11 04:14:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 3118 states have (on average 1.7831943553559975) internal successors, (5560), 3125 states have internal predecessors, (5560), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-11 04:14:40,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5745 transitions. [2024-10-11 04:14:40,020 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5745 transitions. Word has length 112 [2024-10-11 04:14:40,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:40,021 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5745 transitions. [2024-10-11 04:14:40,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5745 transitions. [2024-10-11 04:14:40,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:14:40,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:40,026 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] [2024-10-11 04:14:40,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:14:40,026 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:40,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:40,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1146280722, now seen corresponding path program 1 times [2024-10-11 04:14:40,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:40,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788504370] [2024-10-11 04:14:40,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:40,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:40,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:40,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:14:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:40,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:14:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:40,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:14:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:40,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:14:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:40,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:14:40,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:40,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788504370] [2024-10-11 04:14:40,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788504370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:40,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:40,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:40,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990428126] [2024-10-11 04:14:40,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:40,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:40,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:40,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:40,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:40,220 INFO L87 Difference]: Start difference. First operand 3241 states and 5745 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:41,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:41,318 INFO L93 Difference]: Finished difference Result 4761 states and 8241 transitions. [2024-10-11 04:14:41,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:14:41,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-10-11 04:14:41,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:41,335 INFO L225 Difference]: With dead ends: 4761 [2024-10-11 04:14:41,335 INFO L226 Difference]: Without dead ends: 3654 [2024-10-11 04:14:41,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:14:41,342 INFO L432 NwaCegarLoop]: 4135 mSDtfsCounter, 4657 mSDsluCounter, 16370 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4672 SdHoareTripleChecker+Valid, 20505 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:41,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4672 Valid, 20505 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:14:41,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2024-10-11 04:14:41,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3241. [2024-10-11 04:14:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 3118 states have (on average 1.781590763309814) internal successors, (5555), 3125 states have internal predecessors, (5555), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-11 04:14:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5740 transitions. [2024-10-11 04:14:41,469 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5740 transitions. Word has length 112 [2024-10-11 04:14:41,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:41,469 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5740 transitions. [2024-10-11 04:14:41,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:41,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5740 transitions. [2024-10-11 04:14:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:14:41,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:41,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] [2024-10-11 04:14:41,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:14:41,472 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:41,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:41,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1117780432, now seen corresponding path program 1 times [2024-10-11 04:14:41,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:41,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010802366] [2024-10-11 04:14:41,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:41,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:41,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:41,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:14:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:41,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:14:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:41,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:14:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:41,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:14:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:41,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:14:41,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:41,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010802366] [2024-10-11 04:14:41,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010802366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:41,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:41,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:41,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374978034] [2024-10-11 04:14:41,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:41,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:41,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:41,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:41,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:41,667 INFO L87 Difference]: Start difference. First operand 3241 states and 5740 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:42,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:42,813 INFO L93 Difference]: Finished difference Result 4754 states and 8213 transitions. [2024-10-11 04:14:42,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:14:42,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-10-11 04:14:42,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:42,837 INFO L225 Difference]: With dead ends: 4754 [2024-10-11 04:14:42,838 INFO L226 Difference]: Without dead ends: 3647 [2024-10-11 04:14:42,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:14:42,848 INFO L432 NwaCegarLoop]: 4135 mSDtfsCounter, 4759 mSDsluCounter, 12296 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4774 SdHoareTripleChecker+Valid, 16431 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:42,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4774 Valid, 16431 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:14:42,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3647 states. [2024-10-11 04:14:42,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3647 to 3241. [2024-10-11 04:14:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 3118 states have (on average 1.7799871712636306) internal successors, (5550), 3125 states have internal predecessors, (5550), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-11 04:14:42,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5735 transitions. [2024-10-11 04:14:42,973 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5735 transitions. Word has length 112 [2024-10-11 04:14:42,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:42,974 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5735 transitions. [2024-10-11 04:14:42,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:42,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5735 transitions. [2024-10-11 04:14:42,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:14:42,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:42,977 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] [2024-10-11 04:14:42,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:14:42,978 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:42,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:42,978 INFO L85 PathProgramCache]: Analyzing trace with hash -822801582, now seen corresponding path program 1 times [2024-10-11 04:14:42,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:42,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396846911] [2024-10-11 04:14:42,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:42,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:43,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:43,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:14:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:43,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:14:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:43,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:14:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:43,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:14:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:14:43,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:43,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396846911] [2024-10-11 04:14:43,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396846911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:43,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:43,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:43,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109842550] [2024-10-11 04:14:43,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:43,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:43,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:43,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:43,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:43,162 INFO L87 Difference]: Start difference. First operand 3241 states and 5735 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:44,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:44,071 INFO L93 Difference]: Finished difference Result 4742 states and 8175 transitions. [2024-10-11 04:14:44,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:14:44,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-10-11 04:14:44,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:44,090 INFO L225 Difference]: With dead ends: 4742 [2024-10-11 04:14:44,090 INFO L226 Difference]: Without dead ends: 3635 [2024-10-11 04:14:44,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:14:44,097 INFO L432 NwaCegarLoop]: 4135 mSDtfsCounter, 4755 mSDsluCounter, 12296 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4770 SdHoareTripleChecker+Valid, 16431 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:44,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4770 Valid, 16431 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:14:44,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3635 states. [2024-10-11 04:14:44,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3635 to 3241. [2024-10-11 04:14:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 3118 states have (on average 1.7783835792174472) internal successors, (5545), 3125 states have internal predecessors, (5545), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-11 04:14:44,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5730 transitions. [2024-10-11 04:14:44,211 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5730 transitions. Word has length 112 [2024-10-11 04:14:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:44,211 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5730 transitions. [2024-10-11 04:14:44,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:44,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5730 transitions. [2024-10-11 04:14:44,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:14:44,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:44,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] [2024-10-11 04:14:44,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:14:44,214 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:44,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:44,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1593535148, now seen corresponding path program 1 times [2024-10-11 04:14:44,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:44,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245117700] [2024-10-11 04:14:44,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:44,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:44,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:44,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:14:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:44,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:14:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:44,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:14:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:44,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:14:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:14:44,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:44,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245117700] [2024-10-11 04:14:44,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245117700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:44,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:44,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:44,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757408826] [2024-10-11 04:14:44,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:44,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:44,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:44,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:44,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:44,407 INFO L87 Difference]: Start difference. First operand 3241 states and 5730 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:46,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:46,612 INFO L93 Difference]: Finished difference Result 6242 states and 10548 transitions. [2024-10-11 04:14:46,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:14:46,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-10-11 04:14:46,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:46,635 INFO L225 Difference]: With dead ends: 6242 [2024-10-11 04:14:46,635 INFO L226 Difference]: Without dead ends: 5135 [2024-10-11 04:14:46,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:14:46,644 INFO L432 NwaCegarLoop]: 4288 mSDtfsCounter, 5146 mSDsluCounter, 16914 mSDsCounter, 0 mSdLazyCounter, 2244 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5168 SdHoareTripleChecker+Valid, 21202 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:46,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5168 Valid, 21202 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2244 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:14:46,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2024-10-11 04:14:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 4122. [2024-10-11 04:14:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4122 states, 3911 states have (on average 1.7371516236256712) internal successors, (6794), 3922 states have internal predecessors, (6794), 147 states have call successors, (147), 55 states have call predecessors, (147), 62 states have return successors, (180), 152 states have call predecessors, (180), 145 states have call successors, (180) [2024-10-11 04:14:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4122 states to 4122 states and 7121 transitions. [2024-10-11 04:14:46,897 INFO L78 Accepts]: Start accepts. Automaton has 4122 states and 7121 transitions. Word has length 112 [2024-10-11 04:14:46,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:46,898 INFO L471 AbstractCegarLoop]: Abstraction has 4122 states and 7121 transitions. [2024-10-11 04:14:46,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4122 states and 7121 transitions. [2024-10-11 04:14:46,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:14:46,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:46,901 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] [2024-10-11 04:14:46,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:14:46,902 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:46,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:46,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1706738450, now seen corresponding path program 1 times [2024-10-11 04:14:46,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:46,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066280671] [2024-10-11 04:14:46,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:46,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:46,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:47,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:14:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:47,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:14:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:47,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:14:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:47,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:14:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:47,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:14:47,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:47,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066280671] [2024-10-11 04:14:47,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066280671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:47,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:47,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:47,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491356802] [2024-10-11 04:14:47,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:47,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:47,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:47,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:47,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:47,093 INFO L87 Difference]: Start difference. First operand 4122 states and 7121 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:49,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:49,444 INFO L93 Difference]: Finished difference Result 9619 states and 15939 transitions. [2024-10-11 04:14:49,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:14:49,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-10-11 04:14:49,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:49,468 INFO L225 Difference]: With dead ends: 9619 [2024-10-11 04:14:49,469 INFO L226 Difference]: Without dead ends: 7631 [2024-10-11 04:14:49,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:14:49,479 INFO L432 NwaCegarLoop]: 4287 mSDtfsCounter, 4941 mSDsluCounter, 16911 mSDsCounter, 0 mSdLazyCounter, 2627 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4954 SdHoareTripleChecker+Valid, 21198 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:49,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4954 Valid, 21198 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2627 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 04:14:49,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7631 states. [2024-10-11 04:14:49,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7631 to 5793. [2024-10-11 04:14:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5793 states, 5410 states have (on average 1.688354898336414) internal successors, (9134), 5429 states have internal predecessors, (9134), 263 states have call successors, (263), 103 states have call predecessors, (263), 118 states have return successors, (358), 276 states have call predecessors, (358), 261 states have call successors, (358) [2024-10-11 04:14:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5793 states to 5793 states and 9755 transitions. [2024-10-11 04:14:49,776 INFO L78 Accepts]: Start accepts. Automaton has 5793 states and 9755 transitions. Word has length 112 [2024-10-11 04:14:49,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:49,777 INFO L471 AbstractCegarLoop]: Abstraction has 5793 states and 9755 transitions. [2024-10-11 04:14:49,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:49,777 INFO L276 IsEmpty]: Start isEmpty. Operand 5793 states and 9755 transitions. [2024-10-11 04:14:49,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:14:49,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:49,781 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] [2024-10-11 04:14:49,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:14:49,781 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:49,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:49,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1120462228, now seen corresponding path program 1 times [2024-10-11 04:14:49,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:49,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088914754] [2024-10-11 04:14:49,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:49,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:49,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:49,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:14:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:49,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:14:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:49,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:14:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:49,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:14:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:14:49,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:49,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088914754] [2024-10-11 04:14:49,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088914754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:49,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:49,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:49,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417727498] [2024-10-11 04:14:49,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:49,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:49,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:49,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:49,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:49,975 INFO L87 Difference]: Start difference. First operand 5793 states and 9755 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:52,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:52,818 INFO L93 Difference]: Finished difference Result 16012 states and 26135 transitions. [2024-10-11 04:14:52,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:14:52,818 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-10-11 04:14:52,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:52,865 INFO L225 Difference]: With dead ends: 16012 [2024-10-11 04:14:52,865 INFO L226 Difference]: Without dead ends: 12353 [2024-10-11 04:14:52,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:14:52,886 INFO L432 NwaCegarLoop]: 4288 mSDtfsCounter, 5074 mSDsluCounter, 16914 mSDsCounter, 0 mSdLazyCounter, 2218 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5096 SdHoareTripleChecker+Valid, 21202 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:52,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5096 Valid, 21202 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2218 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 04:14:52,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12353 states. [2024-10-11 04:14:53,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12353 to 9214. [2024-10-11 04:14:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9214 states, 8495 states have (on average 1.6447321954090641) internal successors, (13972), 8530 states have internal predecessors, (13972), 487 states have call successors, (487), 199 states have call predecessors, (487), 230 states have return successors, (760), 516 states have call predecessors, (760), 485 states have call successors, (760) [2024-10-11 04:14:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9214 states to 9214 states and 15219 transitions. [2024-10-11 04:14:53,606 INFO L78 Accepts]: Start accepts. Automaton has 9214 states and 15219 transitions. Word has length 112 [2024-10-11 04:14:53,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:53,607 INFO L471 AbstractCegarLoop]: Abstraction has 9214 states and 15219 transitions. [2024-10-11 04:14:53,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:53,607 INFO L276 IsEmpty]: Start isEmpty. Operand 9214 states and 15219 transitions. [2024-10-11 04:14:53,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:14:53,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:53,613 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] [2024-10-11 04:14:53,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:14:53,614 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:53,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:53,614 INFO L85 PathProgramCache]: Analyzing trace with hash -838112558, now seen corresponding path program 1 times [2024-10-11 04:14:53,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:53,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491383301] [2024-10-11 04:14:53,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:53,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:53,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:53,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:14:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:53,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:14:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:53,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:14:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:53,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:14:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:14:53,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:53,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491383301] [2024-10-11 04:14:53,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491383301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:53,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:53,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:53,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744014947] [2024-10-11 04:14:53,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:53,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:53,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:53,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:53,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:53,789 INFO L87 Difference]: Start difference. First operand 9214 states and 15219 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:56,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:56,821 INFO L93 Difference]: Finished difference Result 28783 states and 46745 transitions. [2024-10-11 04:14:56,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:14:56,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-10-11 04:14:56,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:56,906 INFO L225 Difference]: With dead ends: 28783 [2024-10-11 04:14:56,907 INFO L226 Difference]: Without dead ends: 21703 [2024-10-11 04:14:56,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:14:56,938 INFO L432 NwaCegarLoop]: 4288 mSDtfsCounter, 5038 mSDsluCounter, 16914 mSDsCounter, 0 mSdLazyCounter, 2205 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5060 SdHoareTripleChecker+Valid, 21202 SdHoareTripleChecker+Invalid, 2265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:56,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5060 Valid, 21202 Invalid, 2265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2205 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 04:14:56,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21703 states. [2024-10-11 04:14:57,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21703 to 16055. [2024-10-11 04:14:57,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16055 states, 14680 states have (on average 1.6129427792915532) internal successors, (23678), 14747 states have internal predecessors, (23678), 919 states have call successors, (919), 391 states have call predecessors, (919), 454 states have return successors, (1710), 980 states have call predecessors, (1710), 917 states have call successors, (1710) [2024-10-11 04:14:57,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16055 states to 16055 states and 26307 transitions. [2024-10-11 04:14:57,876 INFO L78 Accepts]: Start accepts. Automaton has 16055 states and 26307 transitions. Word has length 112 [2024-10-11 04:14:57,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:57,877 INFO L471 AbstractCegarLoop]: Abstraction has 16055 states and 26307 transitions. [2024-10-11 04:14:57,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:14:57,877 INFO L276 IsEmpty]: Start isEmpty. Operand 16055 states and 26307 transitions. [2024-10-11 04:14:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:14:57,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:57,888 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] [2024-10-11 04:14:57,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:14:57,888 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:57,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:57,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1038370260, now seen corresponding path program 1 times [2024-10-11 04:14:57,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:57,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952535897] [2024-10-11 04:14:57,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:57,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:57,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:57,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:14:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:58,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:14:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:58,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:14:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:58,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:14:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:58,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:14:58,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:58,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952535897] [2024-10-11 04:14:58,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952535897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:58,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:58,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:58,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95510634] [2024-10-11 04:14:58,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:58,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:58,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:58,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:58,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:58,280 INFO L87 Difference]: Start difference. First operand 16055 states and 26307 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:15:02,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:02,543 INFO L93 Difference]: Finished difference Result 53846 states and 87783 transitions. [2024-10-11 04:15:02,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:15:02,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-10-11 04:15:02,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:02,717 INFO L225 Difference]: With dead ends: 53846 [2024-10-11 04:15:02,717 INFO L226 Difference]: Without dead ends: 39925 [2024-10-11 04:15:02,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:15:02,782 INFO L432 NwaCegarLoop]: 4288 mSDtfsCounter, 4912 mSDsluCounter, 16914 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4925 SdHoareTripleChecker+Valid, 21202 SdHoareTripleChecker+Invalid, 2510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:02,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4925 Valid, 21202 Invalid, 2510 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 04:15:02,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39925 states. [2024-10-11 04:15:04,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39925 to 29736. [2024-10-11 04:15:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29736 states, 27081 states have (on average 1.5934418965326242) internal successors, (43152), 27212 states have internal predecessors, (43152), 1751 states have call successors, (1751), 775 states have call predecessors, (1751), 902 states have return successors, (4064), 1876 states have call predecessors, (4064), 1749 states have call successors, (4064) [2024-10-11 04:15:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29736 states to 29736 states and 48967 transitions. [2024-10-11 04:15:04,896 INFO L78 Accepts]: Start accepts. Automaton has 29736 states and 48967 transitions. Word has length 112 [2024-10-11 04:15:04,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:04,897 INFO L471 AbstractCegarLoop]: Abstraction has 29736 states and 48967 transitions. [2024-10-11 04:15:04,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:15:04,897 INFO L276 IsEmpty]: Start isEmpty. Operand 29736 states and 48967 transitions. [2024-10-11 04:15:04,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:15:04,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:04,918 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] [2024-10-11 04:15:04,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:15:04,919 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:04,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:04,919 INFO L85 PathProgramCache]: Analyzing trace with hash -840760686, now seen corresponding path program 1 times [2024-10-11 04:15:04,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:04,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005644616] [2024-10-11 04:15:04,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:04,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:04,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:05,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:15:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:05,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:15:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:05,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:15:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:05,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:15:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:05,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:05,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005644616] [2024-10-11 04:15:05,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005644616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:05,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:05,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:05,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021601112] [2024-10-11 04:15:05,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:05,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:05,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:05,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:05,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:05,075 INFO L87 Difference]: Start difference. First operand 29736 states and 48967 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:15:11,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:11,667 INFO L93 Difference]: Finished difference Result 103013 states and 170141 transitions. [2024-10-11 04:15:11,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:15:11,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-10-11 04:15:11,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:11,977 INFO L225 Difference]: With dead ends: 103013 [2024-10-11 04:15:11,977 INFO L226 Difference]: Without dead ends: 75411 [2024-10-11 04:15:12,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:15:12,060 INFO L432 NwaCegarLoop]: 4288 mSDtfsCounter, 4972 mSDsluCounter, 16914 mSDsCounter, 0 mSdLazyCounter, 2174 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4994 SdHoareTripleChecker+Valid, 21202 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:12,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4994 Valid, 21202 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2174 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 04:15:12,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75411 states. [2024-10-11 04:15:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75411 to 57097. [2024-10-11 04:15:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57097 states, 51946 states have (on average 1.58291302506449) internal successors, (82226), 52205 states have internal predecessors, (82226), 3351 states have call successors, (3351), 1543 states have call predecessors, (3351), 1798 states have return successors, (10166), 3604 states have call predecessors, (10166), 3349 states have call successors, (10166) [2024-10-11 04:15:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57097 states to 57097 states and 95743 transitions. [2024-10-11 04:15:16,915 INFO L78 Accepts]: Start accepts. Automaton has 57097 states and 95743 transitions. Word has length 112 [2024-10-11 04:15:16,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:16,916 INFO L471 AbstractCegarLoop]: Abstraction has 57097 states and 95743 transitions. [2024-10-11 04:15:16,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:15:16,916 INFO L276 IsEmpty]: Start isEmpty. Operand 57097 states and 95743 transitions. [2024-10-11 04:15:16,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:15:16,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:16,960 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] [2024-10-11 04:15:16,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:15:16,960 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:16,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:16,961 INFO L85 PathProgramCache]: Analyzing trace with hash 484095508, now seen corresponding path program 1 times [2024-10-11 04:15:16,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:16,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437950577] [2024-10-11 04:15:16,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:16,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:17,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:17,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:15:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:17,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:15:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:17,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:15:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:17,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:15:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:17,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:15:17,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:17,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437950577] [2024-10-11 04:15:17,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437950577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:17,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:17,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:17,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643485638] [2024-10-11 04:15:17,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:17,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:17,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:17,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:17,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:17,140 INFO L87 Difference]: Start difference. First operand 57097 states and 95743 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)