./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_label43+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_label43+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 ece5e10278ff4277201bc584c9d4f272bab8d3b56dec5e2dfa257f3717fce473 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:16:37,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:16:37,476 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:16:37,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:16:37,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:16:37,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:16:37,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:16:37,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:16:37,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:16:37,519 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:16:37,519 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:16:37,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:16:37,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:16:37,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:16:37,521 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:16:37,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:16:37,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:16:37,522 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:16:37,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:16:37,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:16:37,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:16:37,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:16:37,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:16:37,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:16:37,528 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:16:37,528 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:16:37,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:16:37,529 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:16:37,529 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:16:37,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:16:37,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:16:37,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:16:37,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:16:37,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:16:37,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:16:37,531 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:16:37,531 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:16:37,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:16:37,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:16:37,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:16:37,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:16:37,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:16:37,533 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-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 -> ece5e10278ff4277201bc584c9d4f272bab8d3b56dec5e2dfa257f3717fce473 [2024-10-11 04:16:37,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:16:37,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:16:37,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:16:37,858 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:16:37,858 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:16:37,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-2.c [2024-10-11 04:16:39,332 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:16:39,936 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:16:39,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-2.c [2024-10-11 04:16:39,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/841d6be4d/dd32ec9cbe6d44869470023d5d6d775b/FLAGd81db8a01 [2024-10-11 04:16:40,012 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/841d6be4d/dd32ec9cbe6d44869470023d5d6d775b [2024-10-11 04:16:40,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:16:40,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:16:40,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:16:40,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:16:40,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:16:40,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:16:40" (1/1) ... [2024-10-11 04:16:40,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f4f6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:40, skipping insertion in model container [2024-10-11 04:16:40,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:16:40" (1/1) ... [2024-10-11 04:16:40,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:16:41,827 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_label43+token_ring.07.cil-2.c[381679,381692] [2024-10-11 04:16:41,849 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_label43+token_ring.07.cil-2.c[383339,383352] [2024-10-11 04:16:42,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:16:42,090 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:16:42,922 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_label43+token_ring.07.cil-2.c[381679,381692] [2024-10-11 04:16:42,926 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_label43+token_ring.07.cil-2.c[383339,383352] [2024-10-11 04:16:42,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:16:43,007 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:16:43,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:43 WrapperNode [2024-10-11 04:16:43,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:16:43,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:16:43,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:16:43,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:16:43,018 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:16:43" (1/1) ... [2024-10-11 04:16:43,093 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:16:43" (1/1) ... [2024-10-11 04:16:43,457 INFO L138 Inliner]: procedures = 58, calls = 63, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 12939 [2024-10-11 04:16:43,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:16:43,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:16:43,459 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:16:43,459 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:16:43,470 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:43" (1/1) ... [2024-10-11 04:16:43,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:43" (1/1) ... [2024-10-11 04:16:43,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:43" (1/1) ... [2024-10-11 04:16:43,627 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:16:43,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:43" (1/1) ... [2024-10-11 04:16:43,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:43" (1/1) ... [2024-10-11 04:16:43,875 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:43" (1/1) ... [2024-10-11 04:16:43,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:43" (1/1) ... [2024-10-11 04:16:43,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:43" (1/1) ... [2024-10-11 04:16:44,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:43" (1/1) ... [2024-10-11 04:16:44,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:16:44,128 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:16:44,128 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:16:44,128 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:16:44,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:43" (1/1) ... [2024-10-11 04:16:44,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:16:44,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:16:44,162 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:16:44,164 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:16:44,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:16:44,218 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:16:44,218 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:16:44,218 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:16:44,220 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:16:44,220 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:16:44,220 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:16:44,221 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 04:16:44,221 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 04:16:44,221 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:16:44,221 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:16:44,221 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:16:44,221 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:16:44,221 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:16:44,221 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:16:44,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:16:44,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:16:44,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:16:44,375 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:16:44,377 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:16:52,056 INFO L? ?]: Removed 1729 outVars from TransFormulas that were not future-live. [2024-10-11 04:16:52,057 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:16:52,191 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:16:52,192 INFO L314 CfgBuilder]: Removed 11 assume(true) statements. [2024-10-11 04:16:52,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:16:52 BoogieIcfgContainer [2024-10-11 04:16:52,192 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:16:52,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:16:52,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:16:52,199 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:16:52,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:16:40" (1/3) ... [2024-10-11 04:16:52,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a67ee36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:16:52, skipping insertion in model container [2024-10-11 04:16:52,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:43" (2/3) ... [2024-10-11 04:16:52,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a67ee36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:16:52, skipping insertion in model container [2024-10-11 04:16:52,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:16:52" (3/3) ... [2024-10-11 04:16:52,202 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.07.cil-2.c [2024-10-11 04:16:52,219 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:16:52,220 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:16:52,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:16:52,379 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;@146fdf5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:16:52,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:16:52,395 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:16:52,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:16:52,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:16:52,414 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:16:52,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:16:52,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:16:52,422 INFO L85 PathProgramCache]: Analyzing trace with hash -626584138, now seen corresponding path program 1 times [2024-10-11 04:16:52,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:16:52,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824351056] [2024-10-11 04:16:52,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:16:52,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:16:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:52,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:16:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:52,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:16:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:52,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:16:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:53,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:16:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:53,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:16:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:53,063 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:16:53,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:16:53,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824351056] [2024-10-11 04:16:53,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824351056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:16:53,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:16:53,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:16:53,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833054090] [2024-10-11 04:16:53,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:16:53,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:16:53,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:16:53,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:16:53,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:16:53,113 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:16:54,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:16:54,481 INFO L93 Difference]: Finished difference Result 4797 states and 8982 transitions. [2024-10-11 04:16:54,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:16:54,484 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:16:54,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:16:54,513 INFO L225 Difference]: With dead ends: 4797 [2024-10-11 04:16:54,514 INFO L226 Difference]: Without dead ends: 2439 [2024-10-11 04:16:54,524 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:16:54,528 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:16:54,529 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:16:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2024-10-11 04:16:54,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 2359. [2024-10-11 04:16:54,672 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:16:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 4338 transitions. [2024-10-11 04:16:54,685 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 4338 transitions. Word has length 112 [2024-10-11 04:16:54,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:16:54,685 INFO L471 AbstractCegarLoop]: Abstraction has 2359 states and 4338 transitions. [2024-10-11 04:16:54,686 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:16:54,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 4338 transitions. [2024-10-11 04:16:54,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:16:54,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:16:54,690 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:16:54,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:16:54,691 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:16:54,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:16:54,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1657625036, now seen corresponding path program 1 times [2024-10-11 04:16:54,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:16:54,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009337307] [2024-10-11 04:16:54,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:16:54,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:16:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:54,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:16:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:55,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:16:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:55,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:16:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:55,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:16:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:55,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:16:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:55,130 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:16:55,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:16:55,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009337307] [2024-10-11 04:16:55,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009337307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:16:55,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:16:55,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:16:55,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649131386] [2024-10-11 04:16:55,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:16:55,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:16:55,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:16:55,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:16:55,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:16:55,136 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:16:56,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:16:56,979 INFO L93 Difference]: Finished difference Result 2978 states and 5358 transitions. [2024-10-11 04:16:56,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:16:56,980 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:16:56,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:16:56,995 INFO L225 Difference]: With dead ends: 2978 [2024-10-11 04:16:56,995 INFO L226 Difference]: Without dead ends: 2753 [2024-10-11 04:16:56,997 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:16:56,998 INFO L432 NwaCegarLoop]: 4148 mSDtfsCounter, 4905 mSDsluCounter, 12430 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4919 SdHoareTripleChecker+Valid, 16578 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:16:56,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4919 Valid, 16578 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 04:16:57,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2024-10-11 04:16:57,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 2592. [2024-10-11 04:16:57,080 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:16:57,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 4716 transitions. [2024-10-11 04:16:57,090 INFO L78 Accepts]: Start accepts. Automaton has 2592 states and 4716 transitions. Word has length 112 [2024-10-11 04:16:57,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:16:57,091 INFO L471 AbstractCegarLoop]: Abstraction has 2592 states and 4716 transitions. [2024-10-11 04:16:57,091 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:16:57,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 4716 transitions. [2024-10-11 04:16:57,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:16:57,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:16:57,098 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:16:57,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:16:57,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:16:57,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:16:57,100 INFO L85 PathProgramCache]: Analyzing trace with hash -663372240, now seen corresponding path program 1 times [2024-10-11 04:16:57,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:16:57,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567087042] [2024-10-11 04:16:57,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:16:57,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:16:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:57,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:16:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:57,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:16:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:57,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:16:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:57,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:16:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:57,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:16:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:16:57,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:16:57,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:16:57,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567087042] [2024-10-11 04:16:57,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567087042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:16:57,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:16:57,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:16:57,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199648872] [2024-10-11 04:16:57,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:16:57,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:16:57,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:16:57,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:16:57,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:16:57,376 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:16:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:16:59,813 INFO L93 Difference]: Finished difference Result 3533 states and 6264 transitions. [2024-10-11 04:16:59,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:16:59,813 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:16:59,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:16:59,827 INFO L225 Difference]: With dead ends: 3533 [2024-10-11 04:16:59,827 INFO L226 Difference]: Without dead ends: 3075 [2024-10-11 04:16:59,829 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:16:59,830 INFO L432 NwaCegarLoop]: 4292 mSDtfsCounter, 4918 mSDsluCounter, 16919 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:16:59,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4932 Valid, 21211 Invalid, 2443 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [55 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 04:16:59,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2024-10-11 04:16:59,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 2808. [2024-10-11 04:16:59,913 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:16:59,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 5059 transitions. [2024-10-11 04:16:59,923 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 5059 transitions. Word has length 112 [2024-10-11 04:16:59,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:16:59,924 INFO L471 AbstractCegarLoop]: Abstraction has 2808 states and 5059 transitions. [2024-10-11 04:16:59,924 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:16:59,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 5059 transitions. [2024-10-11 04:16:59,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:16:59,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:16:59,927 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:16:59,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:16:59,927 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:16:59,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:16:59,928 INFO L85 PathProgramCache]: Analyzing trace with hash 688012978, now seen corresponding path program 1 times [2024-10-11 04:16:59,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:16:59,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026644639] [2024-10-11 04:16:59,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:16:59,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:16:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:00,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:00,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:17:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:00,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:17:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:00,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:17:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:00,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:17:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:00,171 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:17:00,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:00,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026644639] [2024-10-11 04:17:00,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026644639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:00,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:00,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:00,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531537775] [2024-10-11 04:17:00,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:00,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:00,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:00,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:00,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:00,175 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:17:02,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:02,359 INFO L93 Difference]: Finished difference Result 4346 states and 7585 transitions. [2024-10-11 04:17:02,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:17:02,360 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:17:02,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:02,379 INFO L225 Difference]: With dead ends: 4346 [2024-10-11 04:17:02,380 INFO L226 Difference]: Without dead ends: 3672 [2024-10-11 04:17:02,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:17:02,391 INFO L432 NwaCegarLoop]: 4290 mSDtfsCounter, 4916 mSDsluCounter, 16919 mSDsCounter, 0 mSdLazyCounter, 2384 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:02,391 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.7s Time] [2024-10-11 04:17:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2024-10-11 04:17:02,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3241. [2024-10-11 04:17:02,517 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:17:02,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5750 transitions. [2024-10-11 04:17:02,528 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5750 transitions. Word has length 112 [2024-10-11 04:17:02,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:02,529 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5750 transitions. [2024-10-11 04:17:02,529 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:17:02,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5750 transitions. [2024-10-11 04:17:02,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:17:02,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:02,531 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:17:02,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:17:02,532 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:02,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:02,533 INFO L85 PathProgramCache]: Analyzing trace with hash -930961936, now seen corresponding path program 1 times [2024-10-11 04:17:02,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:02,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554857727] [2024-10-11 04:17:02,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:02,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:02,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:02,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:17:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:02,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:17:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:02,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:17:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:02,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:17:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:02,738 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:17:02,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:02,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554857727] [2024-10-11 04:17:02,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554857727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:02,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:02,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:02,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313074828] [2024-10-11 04:17:02,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:02,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:02,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:02,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:02,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:02,740 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:17:03,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:03,888 INFO L93 Difference]: Finished difference Result 4767 states and 8267 transitions. [2024-10-11 04:17:03,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:17:03,889 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:17:03,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:03,905 INFO L225 Difference]: With dead ends: 4767 [2024-10-11 04:17:03,905 INFO L226 Difference]: Without dead ends: 3660 [2024-10-11 04:17:03,910 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:17:03,911 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.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:03,911 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.9s Time] [2024-10-11 04:17:03,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2024-10-11 04:17:04,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3241. [2024-10-11 04:17:04,036 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:17:04,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5745 transitions. [2024-10-11 04:17:04,047 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5745 transitions. Word has length 112 [2024-10-11 04:17:04,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:04,047 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5745 transitions. [2024-10-11 04:17:04,048 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:17:04,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5745 transitions. [2024-10-11 04:17:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:17:04,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:04,050 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:17:04,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:17:04,050 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:04,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:04,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1814470926, now seen corresponding path program 1 times [2024-10-11 04:17:04,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:04,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803119868] [2024-10-11 04:17:04,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:04,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:04,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:04,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:17:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:04,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:17:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:04,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:17:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:04,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:17:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:04,260 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:17:04,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:04,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803119868] [2024-10-11 04:17:04,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803119868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:04,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:04,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:04,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995653678] [2024-10-11 04:17:04,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:04,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:04,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:04,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:04,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:04,262 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:17:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:05,481 INFO L93 Difference]: Finished difference Result 4761 states and 8241 transitions. [2024-10-11 04:17:05,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:17:05,482 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:17:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:05,497 INFO L225 Difference]: With dead ends: 4761 [2024-10-11 04:17:05,497 INFO L226 Difference]: Without dead ends: 3654 [2024-10-11 04:17:05,502 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:17:05,503 INFO L432 NwaCegarLoop]: 4135 mSDtfsCounter, 4657 mSDsluCounter, 16370 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:05,503 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.9s Time] [2024-10-11 04:17:05,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2024-10-11 04:17:05,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3241. [2024-10-11 04:17:05,627 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:17:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5740 transitions. [2024-10-11 04:17:05,639 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5740 transitions. Word has length 112 [2024-10-11 04:17:05,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:05,640 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5740 transitions. [2024-10-11 04:17:05,640 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:17:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5740 transitions. [2024-10-11 04:17:05,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:17:05,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:05,642 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:17:05,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:17:05,642 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:05,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:05,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1842971216, now seen corresponding path program 1 times [2024-10-11 04:17:05,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:05,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192359802] [2024-10-11 04:17:05,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:05,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:05,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:05,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:17:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:05,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:17:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:05,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:17:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:05,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:17:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:05,811 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:17:05,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:05,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192359802] [2024-10-11 04:17:05,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192359802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:05,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:05,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:05,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362540278] [2024-10-11 04:17:05,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:05,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:05,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:05,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:05,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:05,813 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:17:06,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:06,940 INFO L93 Difference]: Finished difference Result 4754 states and 8213 transitions. [2024-10-11 04:17:06,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:17:06,940 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:17:06,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:06,957 INFO L225 Difference]: With dead ends: 4754 [2024-10-11 04:17:06,957 INFO L226 Difference]: Without dead ends: 3647 [2024-10-11 04:17:06,963 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:17:06,964 INFO L432 NwaCegarLoop]: 4135 mSDtfsCounter, 4759 mSDsluCounter, 12296 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:06,964 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.8s Time] [2024-10-11 04:17:06,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3647 states. [2024-10-11 04:17:07,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3647 to 3241. [2024-10-11 04:17:07,120 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:17:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5735 transitions. [2024-10-11 04:17:07,133 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5735 transitions. Word has length 112 [2024-10-11 04:17:07,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:07,133 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5735 transitions. [2024-10-11 04:17:07,134 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:17:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5735 transitions. [2024-10-11 04:17:07,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:17:07,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:07,136 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:17:07,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:17:07,137 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:07,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:07,137 INFO L85 PathProgramCache]: Analyzing trace with hash 511414066, now seen corresponding path program 1 times [2024-10-11 04:17:07,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:07,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228739152] [2024-10-11 04:17:07,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:07,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:07,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:07,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:17:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:07,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:17:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:07,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:17:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:07,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:17:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:07,344 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:17:07,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:07,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228739152] [2024-10-11 04:17:07,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228739152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:07,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:07,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:07,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474757249] [2024-10-11 04:17:07,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:07,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:07,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:07,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:07,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:07,351 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:17:08,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:08,454 INFO L93 Difference]: Finished difference Result 4742 states and 8175 transitions. [2024-10-11 04:17:08,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:17:08,454 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:17:08,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:08,468 INFO L225 Difference]: With dead ends: 4742 [2024-10-11 04:17:08,468 INFO L226 Difference]: Without dead ends: 3635 [2024-10-11 04:17:08,472 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:17:08,473 INFO L432 NwaCegarLoop]: 4135 mSDtfsCounter, 4755 mSDsluCounter, 12296 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:08,474 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.7s Time] [2024-10-11 04:17:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3635 states. [2024-10-11 04:17:08,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3635 to 3241. [2024-10-11 04:17:08,645 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:17:08,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 5730 transitions. [2024-10-11 04:17:08,657 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 5730 transitions. Word has length 112 [2024-10-11 04:17:08,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:08,657 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 5730 transitions. [2024-10-11 04:17:08,658 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:17:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 5730 transitions. [2024-10-11 04:17:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:17:08,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:08,661 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:17:08,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:17:08,661 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:08,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:08,663 INFO L85 PathProgramCache]: Analyzing trace with hash -259319500, now seen corresponding path program 1 times [2024-10-11 04:17:08,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:08,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43803810] [2024-10-11 04:17:08,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:08,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:08,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:08,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:17:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:08,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:17:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:08,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:17:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:08,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:17:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:08,894 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:17:08,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:08,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43803810] [2024-10-11 04:17:08,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43803810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:08,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:08,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:08,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913170489] [2024-10-11 04:17:08,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:08,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:08,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:08,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:08,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:08,898 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:17:11,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:11,154 INFO L93 Difference]: Finished difference Result 6242 states and 10548 transitions. [2024-10-11 04:17:11,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:17:11,154 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:17:11,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:11,170 INFO L225 Difference]: With dead ends: 6242 [2024-10-11 04:17:11,171 INFO L226 Difference]: Without dead ends: 5135 [2024-10-11 04:17:11,176 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:17:11,176 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:11,177 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.5s Time] [2024-10-11 04:17:11,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2024-10-11 04:17:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 4122. [2024-10-11 04:17:11,355 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:17:11,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4122 states to 4122 states and 7121 transitions. [2024-10-11 04:17:11,366 INFO L78 Accepts]: Start accepts. Automaton has 4122 states and 7121 transitions. Word has length 112 [2024-10-11 04:17:11,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:11,367 INFO L471 AbstractCegarLoop]: Abstraction has 4122 states and 7121 transitions. [2024-10-11 04:17:11,367 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:17:11,367 INFO L276 IsEmpty]: Start isEmpty. Operand 4122 states and 7121 transitions. [2024-10-11 04:17:11,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:17:11,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:11,370 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:17:11,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:17:11,371 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:11,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:11,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1254013198, now seen corresponding path program 1 times [2024-10-11 04:17:11,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:11,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890417516] [2024-10-11 04:17:11,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:11,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:11,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:11,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:17:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:11,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:17:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:11,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:17:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:11,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:17:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:11,557 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:17:11,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:11,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890417516] [2024-10-11 04:17:11,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890417516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:11,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:11,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:11,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382744641] [2024-10-11 04:17:11,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:11,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:11,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:11,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:11,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:11,559 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:17:14,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:14,067 INFO L93 Difference]: Finished difference Result 9619 states and 15939 transitions. [2024-10-11 04:17:14,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:17:14,068 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:17:14,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:14,089 INFO L225 Difference]: With dead ends: 9619 [2024-10-11 04:17:14,089 INFO L226 Difference]: Without dead ends: 7631 [2024-10-11 04:17:14,096 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:17:14,097 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:17:14,097 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:17:14,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7631 states. [2024-10-11 04:17:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7631 to 5793. [2024-10-11 04:17:14,396 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:17:14,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5793 states to 5793 states and 9755 transitions. [2024-10-11 04:17:14,414 INFO L78 Accepts]: Start accepts. Automaton has 5793 states and 9755 transitions. Word has length 112 [2024-10-11 04:17:14,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:14,415 INFO L471 AbstractCegarLoop]: Abstraction has 5793 states and 9755 transitions. [2024-10-11 04:17:14,415 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:17:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 5793 states and 9755 transitions. [2024-10-11 04:17:14,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:17:14,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:14,419 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:17:14,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:17:14,419 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:14,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:14,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1840289420, now seen corresponding path program 1 times [2024-10-11 04:17:14,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:14,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591609176] [2024-10-11 04:17:14,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:14,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:14,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:14,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:17:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:14,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:17:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:14,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:17:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:14,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:17:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:14,629 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:17:14,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:14,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591609176] [2024-10-11 04:17:14,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591609176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:14,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:14,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:14,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027889519] [2024-10-11 04:17:14,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:14,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:14,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:14,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:14,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:14,632 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:17:17,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:17,191 INFO L93 Difference]: Finished difference Result 16012 states and 26135 transitions. [2024-10-11 04:17:17,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:17:17,191 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:17:17,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:17,230 INFO L225 Difference]: With dead ends: 16012 [2024-10-11 04:17:17,230 INFO L226 Difference]: Without dead ends: 12353 [2024-10-11 04:17:17,244 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:17:17,245 INFO L432 NwaCegarLoop]: 4288 mSDtfsCounter, 5074 mSDsluCounter, 16914 mSDsCounter, 0 mSdLazyCounter, 2218 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:17,245 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.5s Time] [2024-10-11 04:17:17,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12353 states. [2024-10-11 04:17:17,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12353 to 9214. [2024-10-11 04:17:17,760 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:17:17,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9214 states to 9214 states and 15219 transitions. [2024-10-11 04:17:17,791 INFO L78 Accepts]: Start accepts. Automaton has 9214 states and 15219 transitions. Word has length 112 [2024-10-11 04:17:17,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:17,791 INFO L471 AbstractCegarLoop]: Abstraction has 9214 states and 15219 transitions. [2024-10-11 04:17:17,792 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:17:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 9214 states and 15219 transitions. [2024-10-11 04:17:17,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:17:17,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:17,799 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:17:17,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:17:17,799 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:17,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:17,800 INFO L85 PathProgramCache]: Analyzing trace with hash 496103090, now seen corresponding path program 1 times [2024-10-11 04:17:17,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:17,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430859870] [2024-10-11 04:17:17,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:17,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:17,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:17,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:17:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:17,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:17:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:17,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:17:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:17,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:17:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:17,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:17:17,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:17,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430859870] [2024-10-11 04:17:17,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430859870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:17,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:17,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:17,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44242508] [2024-10-11 04:17:17,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:17,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:17,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:17,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:17,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:17,986 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:17:21,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:21,307 INFO L93 Difference]: Finished difference Result 28783 states and 46745 transitions. [2024-10-11 04:17:21,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:17:21,308 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:17:21,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:21,388 INFO L225 Difference]: With dead ends: 28783 [2024-10-11 04:17:21,389 INFO L226 Difference]: Without dead ends: 21703 [2024-10-11 04:17:21,422 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:17:21,423 INFO L432 NwaCegarLoop]: 4288 mSDtfsCounter, 5038 mSDsluCounter, 16914 mSDsCounter, 0 mSdLazyCounter, 2205 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:21,424 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.6s Time] [2024-10-11 04:17:21,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21703 states. [2024-10-11 04:17:22,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21703 to 16055. [2024-10-11 04:17:22,480 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:17:22,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16055 states to 16055 states and 26307 transitions. [2024-10-11 04:17:22,535 INFO L78 Accepts]: Start accepts. Automaton has 16055 states and 26307 transitions. Word has length 112 [2024-10-11 04:17:22,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:22,535 INFO L471 AbstractCegarLoop]: Abstraction has 16055 states and 26307 transitions. [2024-10-11 04:17:22,536 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:17:22,536 INFO L276 IsEmpty]: Start isEmpty. Operand 16055 states and 26307 transitions. [2024-10-11 04:17:22,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:17:22,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:22,551 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:17:22,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:17:22,551 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:22,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:22,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1922381388, now seen corresponding path program 1 times [2024-10-11 04:17:22,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:22,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555781183] [2024-10-11 04:17:22,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:22,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:22,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:22,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:17:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:22,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:17:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:22,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:17:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:22,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:17:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:17:22,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:22,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555781183] [2024-10-11 04:17:22,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555781183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:22,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:22,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:22,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993201126] [2024-10-11 04:17:22,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:22,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:22,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:22,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:22,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:22,720 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:17:26,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:26,917 INFO L93 Difference]: Finished difference Result 53846 states and 87783 transitions. [2024-10-11 04:17:26,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:17:26,918 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:17:26,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:27,070 INFO L225 Difference]: With dead ends: 53846 [2024-10-11 04:17:27,070 INFO L226 Difference]: Without dead ends: 39925 [2024-10-11 04:17:27,128 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:17:27,129 INFO L432 NwaCegarLoop]: 4288 mSDtfsCounter, 4912 mSDsluCounter, 16914 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4925 SdHoareTripleChecker+Valid, 21202 SdHoareTripleChecker+Invalid, 2510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:27,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4925 Valid, 21202 Invalid, 2510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 04:17:27,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39925 states. [2024-10-11 04:17:29,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39925 to 29736. [2024-10-11 04:17:29,460 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:17:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29736 states to 29736 states and 48967 transitions. [2024-10-11 04:17:29,592 INFO L78 Accepts]: Start accepts. Automaton has 29736 states and 48967 transitions. Word has length 112 [2024-10-11 04:17:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:29,593 INFO L471 AbstractCegarLoop]: Abstraction has 29736 states and 48967 transitions. [2024-10-11 04:17:29,593 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:17:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 29736 states and 48967 transitions. [2024-10-11 04:17:29,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:17:29,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:29,616 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:17:29,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:17:29,616 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:29,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:29,618 INFO L85 PathProgramCache]: Analyzing trace with hash 493454962, now seen corresponding path program 1 times [2024-10-11 04:17:29,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:29,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240751405] [2024-10-11 04:17:29,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:29,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:29,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:29,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:17:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:29,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:17:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:29,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:17:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:29,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:17:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:29,796 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:17:29,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:29,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240751405] [2024-10-11 04:17:29,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240751405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:29,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:29,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:29,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929319503] [2024-10-11 04:17:29,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:29,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:29,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:29,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:29,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:29,798 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:17:36,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:36,237 INFO L93 Difference]: Finished difference Result 103013 states and 170141 transitions. [2024-10-11 04:17:36,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:17:36,238 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:17:36,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:36,615 INFO L225 Difference]: With dead ends: 103013 [2024-10-11 04:17:36,615 INFO L226 Difference]: Without dead ends: 75411 [2024-10-11 04:17:36,962 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:17:36,963 INFO L432 NwaCegarLoop]: 4288 mSDtfsCounter, 4972 mSDsluCounter, 16914 mSDsCounter, 0 mSdLazyCounter, 2174 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:36,963 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.4s Time] [2024-10-11 04:17:37,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75411 states. [2024-10-11 04:17:41,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75411 to 57097. [2024-10-11 04:17:41,276 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:17:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57097 states to 57097 states and 95743 transitions. [2024-10-11 04:17:41,520 INFO L78 Accepts]: Start accepts. Automaton has 57097 states and 95743 transitions. Word has length 112 [2024-10-11 04:17:41,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:41,520 INFO L471 AbstractCegarLoop]: Abstraction has 57097 states and 95743 transitions. [2024-10-11 04:17:41,521 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:17:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 57097 states and 95743 transitions. [2024-10-11 04:17:41,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 04:17:41,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:41,575 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:17:41,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:17:41,575 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:41,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:41,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1818311156, now seen corresponding path program 1 times [2024-10-11 04:17:41,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:41,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265862696] [2024-10-11 04:17:41,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:41,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:41,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:41,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 04:17:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:41,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 04:17:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:41,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:17:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:41,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 04:17:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:41,777 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:17:41,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:41,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265862696] [2024-10-11 04:17:41,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265862696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:41,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:41,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:41,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930169958] [2024-10-11 04:17:41,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:41,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:41,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:41,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:41,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:41,781 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)