./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.10.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.10.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 87df5a94129a3baa1e2e3650ee6bffcda9607641da2006311f5769f81726e25d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:16:46,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:16:46,968 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:46,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:16:46,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:16:47,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:16:47,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:16:47,002 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:16:47,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:16:47,002 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:16:47,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:16:47,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:16:47,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:16:47,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:16:47,007 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:16:47,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:16:47,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:16:47,008 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:16:47,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:16:47,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:16:47,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:16:47,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:16:47,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:16:47,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:16:47,013 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:16:47,013 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:16:47,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:16:47,014 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:16:47,014 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:16:47,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:16:47,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:16:47,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:16:47,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:16:47,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:16:47,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:16:47,015 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:16:47,015 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:16:47,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:16:47,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:16:47,016 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:16:47,016 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:16:47,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:16:47,017 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 -> 87df5a94129a3baa1e2e3650ee6bffcda9607641da2006311f5769f81726e25d [2024-10-11 04:16:47,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:16:47,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:16:47,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:16:47,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:16:47,354 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:16:47,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.10.cil-2.c [2024-10-11 04:16:48,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:16:49,357 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:16:49,358 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.10.cil-2.c [2024-10-11 04:16:49,412 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/65abb7ab1/37d44a32337746d3aca63a54d16604fd/FLAG3e38f8764 [2024-10-11 04:16:49,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/65abb7ab1/37d44a32337746d3aca63a54d16604fd [2024-10-11 04:16:49,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:16:49,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:16:49,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:16:49,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:16:49,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:16:49,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:16:49" (1/1) ... [2024-10-11 04:16:49,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28658b78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:49, skipping insertion in model container [2024-10-11 04:16:49,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:16:49" (1/1) ... [2024-10-11 04:16:49,603 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:16:51,313 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.10.cil-2.c[381679,381692] [2024-10-11 04:16:51,341 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.10.cil-2.c[383339,383352] [2024-10-11 04:16:51,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:16:51,624 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:16:52,386 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.10.cil-2.c[381679,381692] [2024-10-11 04:16:52,391 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.10.cil-2.c[383339,383352] [2024-10-11 04:16:52,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:16:52,521 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:16:52,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:52 WrapperNode [2024-10-11 04:16:52,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:16:52,524 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:16:52,524 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:16:52,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:16:52,532 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:52" (1/1) ... [2024-10-11 04:16:52,647 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:52" (1/1) ... [2024-10-11 04:16:53,085 INFO L138 Inliner]: procedures = 64, calls = 71, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 13113 [2024-10-11 04:16:53,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:16:53,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:16:53,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:16:53,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:16:53,099 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:52" (1/1) ... [2024-10-11 04:16:53,099 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:52" (1/1) ... [2024-10-11 04:16:53,170 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:52" (1/1) ... [2024-10-11 04:16:53,332 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:53,333 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:52" (1/1) ... [2024-10-11 04:16:53,333 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:52" (1/1) ... [2024-10-11 04:16:53,529 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:52" (1/1) ... [2024-10-11 04:16:53,701 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:52" (1/1) ... [2024-10-11 04:16:53,732 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:52" (1/1) ... [2024-10-11 04:16:53,759 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:52" (1/1) ... [2024-10-11 04:16:53,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:16:53,823 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:16:53,823 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:16:53,823 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:16:53,825 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:52" (1/1) ... [2024-10-11 04:16:53,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:16:53,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:16:53,859 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:53,864 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:53,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:16:53,972 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:16:53,972 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:16:53,972 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:16:53,972 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:16:53,972 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:16:53,972 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:16:53,973 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:16:53,973 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:16:53,973 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:16:53,973 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:16:53,973 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:16:53,973 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:16:53,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:16:53,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:16:53,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:16:54,217 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:16:54,221 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:17:02,272 INFO L? ?]: Removed 1743 outVars from TransFormulas that were not future-live. [2024-10-11 04:17:02,273 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:17:02,384 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:17:02,384 INFO L314 CfgBuilder]: Removed 14 assume(true) statements. [2024-10-11 04:17:02,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:17:02 BoogieIcfgContainer [2024-10-11 04:17:02,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:17:02,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:17:02,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:17:02,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:17:02,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:16:49" (1/3) ... [2024-10-11 04:17:02,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e570f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:17:02, skipping insertion in model container [2024-10-11 04:17:02,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:16:52" (2/3) ... [2024-10-11 04:17:02,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e570f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:17:02, skipping insertion in model container [2024-10-11 04:17:02,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:17:02" (3/3) ... [2024-10-11 04:17:02,396 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.10.cil-2.c [2024-10-11 04:17:02,411 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:17:02,412 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:17:02,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:17:02,553 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;@3f137ea2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:17:02,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:17:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 2425 states, 2392 states have (on average 1.8775083612040133) internal successors, (4491), 2395 states have internal predecessors, (4491), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 04:17:02,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:17:02,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:02,593 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:17:02,594 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:02,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:02,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1836165759, now seen corresponding path program 1 times [2024-10-11 04:17:02,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:02,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812438632] [2024-10-11 04:17:02,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:02,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:02,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:03,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:03,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:03,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:03,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:03,327 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:03,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:03,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812438632] [2024-10-11 04:17:03,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812438632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:03,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:03,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:17:03,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064048105] [2024-10-11 04:17:03,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:03,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:17:03,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:03,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:17:03,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:17:03,372 INFO L87 Difference]: Start difference. First operand has 2425 states, 2392 states have (on average 1.8775083612040133) internal successors, (4491), 2395 states have internal predecessors, (4491), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:05,281 INFO L93 Difference]: Finished difference Result 4952 states and 9258 transitions. [2024-10-11 04:17:05,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:17:05,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-11 04:17:05,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:05,318 INFO L225 Difference]: With dead ends: 4952 [2024-10-11 04:17:05,319 INFO L226 Difference]: Without dead ends: 2531 [2024-10-11 04:17:05,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:17:05,336 INFO L432 NwaCegarLoop]: 4219 mSDtfsCounter, 837 mSDsluCounter, 12160 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 16379 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:05,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 16379 Invalid, 963 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:17:05,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2024-10-11 04:17:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2421. [2024-10-11 04:17:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2421 states, 2389 states have (on average 1.8396818752616158) internal successors, (4395), 2391 states have internal predecessors, (4395), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 04:17:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 4443 transitions. [2024-10-11 04:17:05,509 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 4443 transitions. Word has length 141 [2024-10-11 04:17:05,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:05,510 INFO L471 AbstractCegarLoop]: Abstraction has 2421 states and 4443 transitions. [2024-10-11 04:17:05,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:05,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 4443 transitions. [2024-10-11 04:17:05,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:17:05,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:05,515 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:17:05,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:17:05,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:05,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:05,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1161005633, now seen corresponding path program 1 times [2024-10-11 04:17:05,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:05,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997024079] [2024-10-11 04:17:05,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:05,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:05,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:05,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:05,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:05,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:06,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:06,006 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:06,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:06,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997024079] [2024-10-11 04:17:06,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997024079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:06,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:06,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:06,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088401416] [2024-10-11 04:17:06,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:06,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:06,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:06,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:06,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:06,011 INFO L87 Difference]: Start difference. First operand 2421 states and 4443 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:09,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:09,933 INFO L93 Difference]: Finished difference Result 3245 states and 5826 transitions. [2024-10-11 04:17:09,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:17:09,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-11 04:17:09,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:09,947 INFO L225 Difference]: With dead ends: 3245 [2024-10-11 04:17:09,948 INFO L226 Difference]: Without dead ends: 2961 [2024-10-11 04:17:09,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:17:09,951 INFO L432 NwaCegarLoop]: 4363 mSDtfsCounter, 5163 mSDsluCounter, 17153 mSDsCounter, 0 mSdLazyCounter, 3302 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5180 SdHoareTripleChecker+Valid, 21516 SdHoareTripleChecker+Invalid, 3364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:09,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5180 Valid, 21516 Invalid, 3364 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 3302 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 04:17:09,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2024-10-11 04:17:10,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 2724. [2024-10-11 04:17:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2724 states, 2663 states have (on average 1.819752159218926) internal successors, (4846), 2667 states have internal predecessors, (4846), 45 states have call successors, (45), 12 states have call predecessors, (45), 14 states have return successors, (52), 46 states have call predecessors, (52), 45 states have call successors, (52) [2024-10-11 04:17:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2724 states and 4943 transitions. [2024-10-11 04:17:10,055 INFO L78 Accepts]: Start accepts. Automaton has 2724 states and 4943 transitions. Word has length 141 [2024-10-11 04:17:10,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:10,055 INFO L471 AbstractCegarLoop]: Abstraction has 2724 states and 4943 transitions. [2024-10-11 04:17:10,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:10,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 4943 transitions. [2024-10-11 04:17:10,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:17:10,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:10,059 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:17:10,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:17:10,059 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:10,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:10,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1649052739, now seen corresponding path program 1 times [2024-10-11 04:17:10,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:10,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898152240] [2024-10-11 04:17:10,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:10,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:10,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:10,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:10,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:10,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:10,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:10,459 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:10,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:10,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898152240] [2024-10-11 04:17:10,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898152240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:10,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:10,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:10,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77739194] [2024-10-11 04:17:10,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:10,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:10,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:10,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:10,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:10,467 INFO L87 Difference]: Start difference. First operand 2724 states and 4943 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:13,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:13,376 INFO L93 Difference]: Finished difference Result 4288 states and 7546 transitions. [2024-10-11 04:17:13,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:17:13,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-11 04:17:13,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:13,395 INFO L225 Difference]: With dead ends: 4288 [2024-10-11 04:17:13,396 INFO L226 Difference]: Without dead ends: 3703 [2024-10-11 04:17:13,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:17:13,400 INFO L432 NwaCegarLoop]: 4311 mSDtfsCounter, 5204 mSDsluCounter, 17089 mSDsCounter, 0 mSdLazyCounter, 2989 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5221 SdHoareTripleChecker+Valid, 21400 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:13,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5221 Valid, 21400 Invalid, 3059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2989 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 04:17:13,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3703 states. [2024-10-11 04:17:13,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3703 to 3278. [2024-10-11 04:17:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3165 states have (on average 1.7873617693522907) internal successors, (5657), 3171 states have internal predecessors, (5657), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-11 04:17:13,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5840 transitions. [2024-10-11 04:17:13,537 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5840 transitions. Word has length 141 [2024-10-11 04:17:13,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:13,538 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5840 transitions. [2024-10-11 04:17:13,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:13,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5840 transitions. [2024-10-11 04:17:13,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:17:13,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:13,541 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:17:13,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:17:13,542 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:13,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:13,543 INFO L85 PathProgramCache]: Analyzing trace with hash 556417537, now seen corresponding path program 1 times [2024-10-11 04:17:13,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:13,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446860436] [2024-10-11 04:17:13,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:13,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:13,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:13,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:13,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:13,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:13,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:13,835 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:13,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:13,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446860436] [2024-10-11 04:17:13,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446860436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:13,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:13,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:13,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199559770] [2024-10-11 04:17:13,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:13,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:13,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:13,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:13,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:13,840 INFO L87 Difference]: Start difference. First operand 3278 states and 5840 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:15,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:15,485 INFO L93 Difference]: Finished difference Result 4857 states and 8484 transitions. [2024-10-11 04:17:15,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:17:15,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-11 04:17:15,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:15,508 INFO L225 Difference]: With dead ends: 4857 [2024-10-11 04:17:15,509 INFO L226 Difference]: Without dead ends: 3716 [2024-10-11 04:17:15,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:17:15,521 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 5000 mSDsluCounter, 12398 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5018 SdHoareTripleChecker+Valid, 16573 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:15,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5018 Valid, 16573 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:17:15,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3716 states. [2024-10-11 04:17:15,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3716 to 3278. [2024-10-11 04:17:15,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3165 states have (on average 1.785781990521327) internal successors, (5652), 3171 states have internal predecessors, (5652), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-11 04:17:15,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5835 transitions. [2024-10-11 04:17:15,687 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5835 transitions. Word has length 141 [2024-10-11 04:17:15,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:15,688 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5835 transitions. [2024-10-11 04:17:15,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:15,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5835 transitions. [2024-10-11 04:17:15,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:17:15,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:15,691 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:17:15,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:17:15,692 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:15,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:15,692 INFO L85 PathProgramCache]: Analyzing trace with hash -725754749, now seen corresponding path program 1 times [2024-10-11 04:17:15,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:15,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135309779] [2024-10-11 04:17:15,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:15,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:15,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:15,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:15,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:15,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:15,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:16,004 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:16,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:16,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135309779] [2024-10-11 04:17:16,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135309779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:16,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:16,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:16,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333028642] [2024-10-11 04:17:16,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:16,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:16,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:16,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:16,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:16,009 INFO L87 Difference]: Start difference. First operand 3278 states and 5835 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:17,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:17,336 INFO L93 Difference]: Finished difference Result 4853 states and 8463 transitions. [2024-10-11 04:17:17,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:17:17,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-11 04:17:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:17,351 INFO L225 Difference]: With dead ends: 4853 [2024-10-11 04:17:17,351 INFO L226 Difference]: Without dead ends: 3712 [2024-10-11 04:17:17,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:17:17,357 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4998 mSDsluCounter, 12398 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5016 SdHoareTripleChecker+Valid, 16573 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:17,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5016 Valid, 16573 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:17:17,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3712 states. [2024-10-11 04:17:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3712 to 3278. [2024-10-11 04:17:17,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3165 states have (on average 1.7842022116903633) internal successors, (5647), 3171 states have internal predecessors, (5647), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-11 04:17:17,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5830 transitions. [2024-10-11 04:17:17,472 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5830 transitions. Word has length 141 [2024-10-11 04:17:17,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:17,472 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5830 transitions. [2024-10-11 04:17:17,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:17,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5830 transitions. [2024-10-11 04:17:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:17:17,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:17,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:17:17,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:17:17,476 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:17,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1726736833, now seen corresponding path program 1 times [2024-10-11 04:17:17,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:17,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272350651] [2024-10-11 04:17:17,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:17,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:17,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:17,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:17,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:17,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:17,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:17,843 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,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:17,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272350651] [2024-10-11 04:17:17,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272350651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:17,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:17,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:17,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887983274] [2024-10-11 04:17:17,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:17,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:17,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:17,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:17,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:17,848 INFO L87 Difference]: Start difference. First operand 3278 states and 5830 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:19,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:19,502 INFO L93 Difference]: Finished difference Result 4848 states and 8440 transitions. [2024-10-11 04:17:19,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:17:19,503 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-11 04:17:19,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:19,519 INFO L225 Difference]: With dead ends: 4848 [2024-10-11 04:17:19,520 INFO L226 Difference]: Without dead ends: 3707 [2024-10-11 04:17:19,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:17:19,527 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4867 mSDsluCounter, 16496 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4885 SdHoareTripleChecker+Valid, 20671 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:19,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4885 Valid, 20671 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:17:19,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2024-10-11 04:17:19,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3278. [2024-10-11 04:17:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3165 states have (on average 1.7826224328593996) internal successors, (5642), 3171 states have internal predecessors, (5642), 83 states have call successors, (83), 24 states have call predecessors, (83), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-11 04:17:19,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5825 transitions. [2024-10-11 04:17:19,705 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5825 transitions. Word has length 141 [2024-10-11 04:17:19,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:19,705 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5825 transitions. [2024-10-11 04:17:19,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5825 transitions. [2024-10-11 04:17:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:17:19,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:19,709 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:17:19,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:17:19,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:19,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:19,710 INFO L85 PathProgramCache]: Analyzing trace with hash 4734147, now seen corresponding path program 1 times [2024-10-11 04:17:19,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:19,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339559231] [2024-10-11 04:17:19,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:19,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:19,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:19,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:19,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:19,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:19,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:20,000 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:20,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:20,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339559231] [2024-10-11 04:17:20,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339559231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:20,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:20,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:20,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057735180] [2024-10-11 04:17:20,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:20,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:20,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:20,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:20,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:20,004 INFO L87 Difference]: Start difference. First operand 3278 states and 5825 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:23,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:23,215 INFO L93 Difference]: Finished difference Result 6307 states and 10801 transitions. [2024-10-11 04:17:23,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:17:23,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-11 04:17:23,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:23,251 INFO L225 Difference]: With dead ends: 6307 [2024-10-11 04:17:23,251 INFO L226 Difference]: Without dead ends: 5168 [2024-10-11 04:17:23,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:17:23,263 INFO L432 NwaCegarLoop]: 4358 mSDtfsCounter, 5154 mSDsluCounter, 17153 mSDsCounter, 0 mSdLazyCounter, 3198 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5171 SdHoareTripleChecker+Valid, 21511 SdHoareTripleChecker+Invalid, 3262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:23,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5171 Valid, 21511 Invalid, 3262 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [64 Valid, 3198 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 04:17:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2024-10-11 04:17:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 4397. [2024-10-11 04:17:23,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4397 states, 4180 states have (on average 1.7375598086124402) internal successors, (7263), 4190 states have internal predecessors, (7263), 159 states have call successors, (159), 48 states have call predecessors, (159), 56 states have return successors, (202), 166 states have call predecessors, (202), 159 states have call successors, (202) [2024-10-11 04:17:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 7624 transitions. [2024-10-11 04:17:23,449 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 7624 transitions. Word has length 141 [2024-10-11 04:17:23,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:23,449 INFO L471 AbstractCegarLoop]: Abstraction has 4397 states and 7624 transitions. [2024-10-11 04:17:23,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 7624 transitions. [2024-10-11 04:17:23,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:17:23,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:23,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:17:23,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:17:23,453 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:23,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:23,453 INFO L85 PathProgramCache]: Analyzing trace with hash -327908991, now seen corresponding path program 1 times [2024-10-11 04:17:23,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:23,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343575460] [2024-10-11 04:17:23,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:23,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:23,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:23,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:23,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:23,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:23,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:23,698 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:23,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:23,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343575460] [2024-10-11 04:17:23,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343575460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:23,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:23,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:23,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190156646] [2024-10-11 04:17:23,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:23,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:23,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:23,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:23,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:23,702 INFO L87 Difference]: Start difference. First operand 4397 states and 7624 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:25,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:25,433 INFO L93 Difference]: Finished difference Result 7464 states and 12699 transitions. [2024-10-11 04:17:25,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:17:25,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-11 04:17:25,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:25,450 INFO L225 Difference]: With dead ends: 7464 [2024-10-11 04:17:25,450 INFO L226 Difference]: Without dead ends: 5204 [2024-10-11 04:17:25,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:17:25,461 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4871 mSDsluCounter, 16496 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4889 SdHoareTripleChecker+Valid, 20671 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:25,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4889 Valid, 20671 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:17:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2024-10-11 04:17:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 4397. [2024-10-11 04:17:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4397 states, 4180 states have (on average 1.7354066985645933) internal successors, (7254), 4190 states have internal predecessors, (7254), 159 states have call successors, (159), 48 states have call predecessors, (159), 56 states have return successors, (202), 166 states have call predecessors, (202), 159 states have call successors, (202) [2024-10-11 04:17:25,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 7615 transitions. [2024-10-11 04:17:25,658 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 7615 transitions. Word has length 141 [2024-10-11 04:17:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:25,659 INFO L471 AbstractCegarLoop]: Abstraction has 4397 states and 7615 transitions. [2024-10-11 04:17:25,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 7615 transitions. [2024-10-11 04:17:25,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:17:25,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:25,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:17:25,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:17:25,663 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:25,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:25,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1601023235, now seen corresponding path program 1 times [2024-10-11 04:17:25,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:25,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931186385] [2024-10-11 04:17:25,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:25,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:25,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:25,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:25,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:25,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:25,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:25,914 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:25,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:25,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931186385] [2024-10-11 04:17:25,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931186385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:25,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:25,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:25,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833007326] [2024-10-11 04:17:25,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:25,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:25,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:25,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:25,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:25,917 INFO L87 Difference]: Start difference. First operand 4397 states and 7615 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:29,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:29,007 INFO L93 Difference]: Finished difference Result 10354 states and 17366 transitions. [2024-10-11 04:17:29,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:17:29,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-11 04:17:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:29,038 INFO L225 Difference]: With dead ends: 10354 [2024-10-11 04:17:29,038 INFO L226 Difference]: Without dead ends: 8096 [2024-10-11 04:17:29,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:17:29,051 INFO L432 NwaCegarLoop]: 4358 mSDtfsCounter, 5186 mSDsluCounter, 17153 mSDsCounter, 0 mSdLazyCounter, 3078 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5203 SdHoareTripleChecker+Valid, 21511 SdHoareTripleChecker+Invalid, 3142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:29,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5203 Valid, 21511 Invalid, 3142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3078 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 04:17:29,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8096 states. [2024-10-11 04:17:29,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8096 to 6657. [2024-10-11 04:17:29,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6657 states, 6232 states have (on average 1.6882220795892169) internal successors, (10521), 6250 states have internal predecessors, (10521), 311 states have call successors, (311), 96 states have call predecessors, (311), 112 states have return successors, (424), 326 states have call predecessors, (424), 311 states have call successors, (424) [2024-10-11 04:17:29,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 11256 transitions. [2024-10-11 04:17:29,390 INFO L78 Accepts]: Start accepts. Automaton has 6657 states and 11256 transitions. Word has length 141 [2024-10-11 04:17:29,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:29,390 INFO L471 AbstractCegarLoop]: Abstraction has 6657 states and 11256 transitions. [2024-10-11 04:17:29,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand 6657 states and 11256 transitions. [2024-10-11 04:17:29,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:17:29,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:29,396 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:17:29,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:17:29,396 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:29,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:29,397 INFO L85 PathProgramCache]: Analyzing trace with hash -966799099, now seen corresponding path program 1 times [2024-10-11 04:17:29,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:29,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477265312] [2024-10-11 04:17:29,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:29,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:29,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:29,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:29,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:29,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:29,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:17:29,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:29,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477265312] [2024-10-11 04:17:29,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477265312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:29,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:29,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:29,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948765185] [2024-10-11 04:17:29,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:29,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:29,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:29,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:29,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:29,630 INFO L87 Difference]: Start difference. First operand 6657 states and 11256 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:32,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:32,584 INFO L93 Difference]: Finished difference Result 18478 states and 30647 transitions. [2024-10-11 04:17:32,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:17:32,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-11 04:17:32,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:32,640 INFO L225 Difference]: With dead ends: 18478 [2024-10-11 04:17:32,641 INFO L226 Difference]: Without dead ends: 13960 [2024-10-11 04:17:32,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:17:32,666 INFO L432 NwaCegarLoop]: 4312 mSDtfsCounter, 5212 mSDsluCounter, 17089 mSDsCounter, 0 mSdLazyCounter, 2832 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5229 SdHoareTripleChecker+Valid, 21401 SdHoareTripleChecker+Invalid, 2902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:32,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5229 Valid, 21401 Invalid, 2902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2832 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 04:17:32,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13960 states. [2024-10-11 04:17:33,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13960 to 11193. [2024-10-11 04:17:33,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11193 states, 10352 states have (on average 1.6498261205564142) internal successors, (17079), 10386 states have internal predecessors, (17079), 615 states have call successors, (615), 192 states have call predecessors, (615), 224 states have return successors, (922), 646 states have call predecessors, (922), 615 states have call successors, (922) [2024-10-11 04:17:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11193 states to 11193 states and 18616 transitions. [2024-10-11 04:17:33,199 INFO L78 Accepts]: Start accepts. Automaton has 11193 states and 18616 transitions. Word has length 141 [2024-10-11 04:17:33,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:33,199 INFO L471 AbstractCegarLoop]: Abstraction has 11193 states and 18616 transitions. [2024-10-11 04:17:33,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:33,200 INFO L276 IsEmpty]: Start isEmpty. Operand 11193 states and 18616 transitions. [2024-10-11 04:17:33,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:17:33,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:33,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:17:33,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:17:33,208 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:33,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:33,208 INFO L85 PathProgramCache]: Analyzing trace with hash -495442749, now seen corresponding path program 1 times [2024-10-11 04:17:33,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:33,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763777782] [2024-10-11 04:17:33,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:33,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:33,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:33,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:33,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:33,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:33,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:33,431 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:33,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:33,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763777782] [2024-10-11 04:17:33,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763777782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:33,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:33,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:33,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94836505] [2024-10-11 04:17:33,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:33,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:33,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:33,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:33,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:33,433 INFO L87 Difference]: Start difference. First operand 11193 states and 18616 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:37,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:37,477 INFO L93 Difference]: Finished difference Result 38822 states and 64027 transitions. [2024-10-11 04:17:37,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:17:37,478 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-11 04:17:37,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:37,616 INFO L225 Difference]: With dead ends: 38822 [2024-10-11 04:17:37,617 INFO L226 Difference]: Without dead ends: 29768 [2024-10-11 04:17:37,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:17:37,672 INFO L432 NwaCegarLoop]: 4357 mSDtfsCounter, 5552 mSDsluCounter, 17148 mSDsCounter, 0 mSdLazyCounter, 3047 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5580 SdHoareTripleChecker+Valid, 21505 SdHoareTripleChecker+Invalid, 3114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:37,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5580 Valid, 21505 Invalid, 3114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3047 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 04:17:37,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29768 states. [2024-10-11 04:17:38,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29768 to 20233. [2024-10-11 04:17:38,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20233 states, 18592 states have (on average 1.6249462134251291) internal successors, (30211), 18658 states have internal predecessors, (30211), 1191 states have call successors, (1191), 384 states have call predecessors, (1191), 448 states have return successors, (2048), 1254 states have call predecessors, (2048), 1191 states have call successors, (2048) [2024-10-11 04:17:38,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20233 states to 20233 states and 33450 transitions. [2024-10-11 04:17:38,873 INFO L78 Accepts]: Start accepts. Automaton has 20233 states and 33450 transitions. Word has length 141 [2024-10-11 04:17:38,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:38,874 INFO L471 AbstractCegarLoop]: Abstraction has 20233 states and 33450 transitions. [2024-10-11 04:17:38,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:38,874 INFO L276 IsEmpty]: Start isEmpty. Operand 20233 states and 33450 transitions. [2024-10-11 04:17:38,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:17:38,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:38,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:17:38,889 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:38,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:38,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2142805691, now seen corresponding path program 1 times [2024-10-11 04:17:38,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:38,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451337064] [2024-10-11 04:17:38,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:38,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:38,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:39,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:39,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:39,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:39,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:39,101 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:39,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:39,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451337064] [2024-10-11 04:17:39,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451337064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:39,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:39,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:39,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805081124] [2024-10-11 04:17:39,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:39,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:39,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:39,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:39,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:39,103 INFO L87 Difference]: Start difference. First operand 20233 states and 33450 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:44,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:44,533 INFO L93 Difference]: Finished difference Result 74518 states and 123319 transitions. [2024-10-11 04:17:44,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:17:44,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-11 04:17:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:44,782 INFO L225 Difference]: With dead ends: 74518 [2024-10-11 04:17:44,782 INFO L226 Difference]: Without dead ends: 56424 [2024-10-11 04:17:44,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:17:44,853 INFO L432 NwaCegarLoop]: 4354 mSDtfsCounter, 5271 mSDsluCounter, 17145 mSDsCounter, 0 mSdLazyCounter, 3588 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5287 SdHoareTripleChecker+Valid, 21499 SdHoareTripleChecker+Invalid, 3654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:44,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5287 Valid, 21499 Invalid, 3654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3588 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 04:17:44,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56424 states. [2024-10-11 04:17:47,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56424 to 37993. [2024-10-11 04:17:47,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37993 states, 34784 states have (on average 1.610711821527139) internal successors, (56027), 34914 states have internal predecessors, (56027), 2311 states have call successors, (2311), 768 states have call predecessors, (2311), 896 states have return successors, (4754), 2438 states have call predecessors, (4754), 2311 states have call successors, (4754) [2024-10-11 04:17:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37993 states to 37993 states and 63092 transitions. [2024-10-11 04:17:47,637 INFO L78 Accepts]: Start accepts. Automaton has 37993 states and 63092 transitions. Word has length 141 [2024-10-11 04:17:47,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:17:47,639 INFO L471 AbstractCegarLoop]: Abstraction has 37993 states and 63092 transitions. [2024-10-11 04:17:47,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:47,640 INFO L276 IsEmpty]: Start isEmpty. Operand 37993 states and 63092 transitions. [2024-10-11 04:17:47,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 04:17:47,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:17:47,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:17:47,841 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:17:47,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:17:47,842 INFO L85 PathProgramCache]: Analyzing trace with hash 20810883, now seen corresponding path program 1 times [2024-10-11 04:17:47,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:17:47,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49465534] [2024-10-11 04:17:47,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:17:47,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:17:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:47,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:17:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:47,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:17:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:48,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:17:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:48,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:17:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:48,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:17:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:17:48,056 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:48,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:17:48,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49465534] [2024-10-11 04:17:48,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49465534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:17:48,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:17:48,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:17:48,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144845959] [2024-10-11 04:17:48,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:17:48,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:17:48,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:17:48,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:17:48,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:17:48,059 INFO L87 Difference]: Start difference. First operand 37993 states and 63092 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:17:56,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:17:56,202 INFO L93 Difference]: Finished difference Result 144054 states and 240647 transitions. [2024-10-11 04:17:56,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:17:56,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 141 [2024-10-11 04:17:56,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:17:56,667 INFO L225 Difference]: With dead ends: 144054 [2024-10-11 04:17:56,667 INFO L226 Difference]: Without dead ends: 108200 [2024-10-11 04:17:56,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:17:56,786 INFO L432 NwaCegarLoop]: 4357 mSDtfsCounter, 5484 mSDsluCounter, 17148 mSDsCounter, 0 mSdLazyCounter, 3021 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5512 SdHoareTripleChecker+Valid, 21505 SdHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:17:56,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5512 Valid, 21505 Invalid, 3088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3021 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 04:17:56,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108200 states.