./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.13.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.13.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39c77cf00428880e24d066dff5fe9610612ae1f22999f65a4af3f1456418d087 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:17:02,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:17:02,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:17:02,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:17:02,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:17:02,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:17:02,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:17:02,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:17:02,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:17:02,426 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:17:02,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:17:02,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:17:02,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:17:02,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:17:02,428 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:17:02,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:17:02,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:17:02,429 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:17:02,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:17:02,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:17:02,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:17:02,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:17:02,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:17:02,434 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:17:02,434 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:17:02,434 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:17:02,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:17:02,436 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:17:02,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:17:02,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:17:02,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:17:02,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:17:02,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:17:02,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:17:02,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:17:02,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:17:02,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:17:02,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:17:02,438 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:17:02,438 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:17:02,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:17:02,439 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:17:02,439 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 39c77cf00428880e24d066dff5fe9610612ae1f22999f65a4af3f1456418d087 [2024-11-11 22:17:02,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:17:02,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:17:02,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:17:02,679 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:17:02,679 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:17:02,680 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.13.cil-1.c [2024-11-11 22:17:03,935 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:17:04,506 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:17:04,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.13.cil-1.c [2024-11-11 22:17:04,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c015de2af/5709bcf758794ec796909144465d1dd1/FLAG1216f723f [2024-11-11 22:17:05,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c015de2af/5709bcf758794ec796909144465d1dd1 [2024-11-11 22:17:05,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:17:05,015 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:17:05,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:17:05,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:17:05,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:17:05,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:17:05" (1/1) ... [2024-11-11 22:17:05,027 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9860483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:17:05, skipping insertion in model container [2024-11-11 22:17:05,027 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:17:05" (1/1) ... [2024-11-11 22:17:05,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:17:06,457 WARN L250 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_label46+token_ring.13.cil-1.c[382357,382370] [2024-11-11 22:17:06,481 WARN L250 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_label46+token_ring.13.cil-1.c[383339,383352] [2024-11-11 22:17:06,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:17:06,764 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:17:07,359 WARN L250 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_label46+token_ring.13.cil-1.c[382357,382370] [2024-11-11 22:17:07,363 WARN L250 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_label46+token_ring.13.cil-1.c[383339,383352] [2024-11-11 22:17:07,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:17:07,512 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:17:07,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:17:07 WrapperNode [2024-11-11 22:17:07,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:17:07,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:17:07,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:17:07,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:17:07,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:17:07" (1/1) ... [2024-11-11 22:17:07,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:17:07" (1/1) ... [2024-11-11 22:17:07,851 INFO L138 Inliner]: procedures = 70, calls = 81, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 13299 [2024-11-11 22:17:07,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:17:07,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:17:07,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:17:07,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:17:07,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:17:07" (1/1) ... [2024-11-11 22:17:07,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:17:07" (1/1) ... [2024-11-11 22:17:07,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:17:07" (1/1) ... [2024-11-11 22:17:08,113 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-11-11 22:17:08,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:17:07" (1/1) ... [2024-11-11 22:17:08,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:17:07" (1/1) ... [2024-11-11 22:17:08,371 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:17:07" (1/1) ... [2024-11-11 22:17:08,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:17:07" (1/1) ... [2024-11-11 22:17:08,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:17:07" (1/1) ... [2024-11-11 22:17:08,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:17:07" (1/1) ... [2024-11-11 22:17:08,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:17:08,512 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:17:08,512 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:17:08,512 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:17:08,513 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:17:07" (1/1) ... [2024-11-11 22:17:08,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:17:08,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:17:08,544 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 22:17:08,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 22:17:08,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:17:08,592 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-11 22:17:08,592 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-11 22:17:08,593 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:17:08,594 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:17:08,594 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-11 22:17:08,594 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-11 22:17:08,594 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-11 22:17:08,595 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-11 22:17:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-11 22:17:08,595 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-11 22:17:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-11 22:17:08,595 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-11 22:17:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-11 22:17:08,595 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-11 22:17:08,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:17:08,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:17:08,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:17:08,722 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:17:08,724 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:17:15,118 INFO L? ?]: Removed 1765 outVars from TransFormulas that were not future-live. [2024-11-11 22:17:15,118 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:17:15,160 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:17:15,160 INFO L316 CfgBuilder]: Removed 17 assume(true) statements. [2024-11-11 22:17:15,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:17:15 BoogieIcfgContainer [2024-11-11 22:17:15,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:17:15,167 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:17:15,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:17:15,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:17:15,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:17:05" (1/3) ... [2024-11-11 22:17:15,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d7fbcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:17:15, skipping insertion in model container [2024-11-11 22:17:15,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:17:07" (2/3) ... [2024-11-11 22:17:15,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d7fbcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:17:15, skipping insertion in model container [2024-11-11 22:17:15,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:17:15" (3/3) ... [2024-11-11 22:17:15,174 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.13.cil-1.c [2024-11-11 22:17:15,190 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:17:15,191 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:17:15,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:17:15,297 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;@35085725, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:17:15,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:17:15,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 2612 states, 2573 states have (on average 1.8375437232802176) internal successors, (4728), 2578 states have internal predecessors, (4728), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-11 22:17:15,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:17:15,329 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:17:15,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:17:15,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:17:15,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:17:15,337 INFO L85 PathProgramCache]: Analyzing trace with hash 865538110, now seen corresponding path program 1 times [2024-11-11 22:17:15,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:17:15,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533402277] [2024-11-11 22:17:15,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:17:15,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:17:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:15,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:17:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:15,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:17:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:15,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:17:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:15,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:17:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:15,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:17:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:17:15,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:17:15,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533402277] [2024-11-11 22:17:15,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533402277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:17:15,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:17:15,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:17:15,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933834644] [2024-11-11 22:17:15,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:17:15,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:17:15,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:17:16,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:17:16,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:17:16,007 INFO L87 Difference]: Start difference. First operand has 2612 states, 2573 states have (on average 1.8375437232802176) internal successors, (4728), 2578 states have internal predecessors, (4728), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:17:18,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:17:18,051 INFO L93 Difference]: Finished difference Result 5368 states and 9821 transitions. [2024-11-11 22:17:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:17:18,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:17:18,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:17:18,073 INFO L225 Difference]: With dead ends: 5368 [2024-11-11 22:17:18,074 INFO L226 Difference]: Without dead ends: 2697 [2024-11-11 22:17:18,080 INFO L434 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-11-11 22:17:18,084 INFO L435 NwaCegarLoop]: 4417 mSDtfsCounter, 1139 mSDsluCounter, 12537 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 16954 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:17:18,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 16954 Invalid, 1176 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 22:17:18,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2024-11-11 22:17:18,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2544. [2024-11-11 22:17:18,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 2507 states have (on average 1.8201037096130834) internal successors, (4563), 2510 states have internal predecessors, (4563), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-11 22:17:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 4619 transitions. [2024-11-11 22:17:18,205 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 4619 transitions. Word has length 190 [2024-11-11 22:17:18,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:17:18,205 INFO L471 AbstractCegarLoop]: Abstraction has 2544 states and 4619 transitions. [2024-11-11 22:17:18,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:17:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 4619 transitions. [2024-11-11 22:17:18,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:17:18,209 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:17:18,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:17:18,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:17:18,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:17:18,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:17:18,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1681585340, now seen corresponding path program 1 times [2024-11-11 22:17:18,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:17:18,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721991134] [2024-11-11 22:17:18,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:17:18,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:17:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:18,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:17:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:18,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:17:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:18,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:17:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:18,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:17:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:18,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:17:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:17:18,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:17:18,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721991134] [2024-11-11 22:17:18,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721991134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:17:18,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:17:18,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:17:18,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871801010] [2024-11-11 22:17:18,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:17:18,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:17:18,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:17:18,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:17:18,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:17:18,425 INFO L87 Difference]: Start difference. First operand 2544 states and 4619 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:17:20,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:17:20,070 INFO L93 Difference]: Finished difference Result 3103 states and 5515 transitions. [2024-11-11 22:17:20,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:17:20,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:17:20,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:17:20,080 INFO L225 Difference]: With dead ends: 3103 [2024-11-11 22:17:20,080 INFO L226 Difference]: Without dead ends: 2697 [2024-11-11 22:17:20,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:17:20,082 INFO L435 NwaCegarLoop]: 4347 mSDtfsCounter, 1125 mSDsluCounter, 12334 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 16681 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:17:20,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 16681 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 22:17:20,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2024-11-11 22:17:20,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2544. [2024-11-11 22:17:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 2507 states have (on average 1.8197048264858398) internal successors, (4562), 2510 states have internal predecessors, (4562), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-11 22:17:20,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 4618 transitions. [2024-11-11 22:17:20,132 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 4618 transitions. Word has length 190 [2024-11-11 22:17:20,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:17:20,133 INFO L471 AbstractCegarLoop]: Abstraction has 2544 states and 4618 transitions. [2024-11-11 22:17:20,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:17:20,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 4618 transitions. [2024-11-11 22:17:20,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:17:20,135 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:17:20,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:17:20,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:17:20,135 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:17:20,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:17:20,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1032992570, now seen corresponding path program 1 times [2024-11-11 22:17:20,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:17:20,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567588119] [2024-11-11 22:17:20,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:17:20,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:17:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:20,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:17:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:20,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:17:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:20,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:17:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:20,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:17:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:20,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:17:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:17:20,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:17:20,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567588119] [2024-11-11 22:17:20,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567588119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:17:20,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:17:20,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:17:20,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042418273] [2024-11-11 22:17:20,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:17:20,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:17:20,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:17:20,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:17:20,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:17:20,628 INFO L87 Difference]: Start difference. First operand 2544 states and 4618 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:17:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:17:23,645 INFO L93 Difference]: Finished difference Result 3674 states and 6437 transitions. [2024-11-11 22:17:23,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:17:23,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:17:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:17:23,657 INFO L225 Difference]: With dead ends: 3674 [2024-11-11 22:17:23,657 INFO L226 Difference]: Without dead ends: 3272 [2024-11-11 22:17:23,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:17:23,660 INFO L435 NwaCegarLoop]: 4315 mSDtfsCounter, 5662 mSDsluCounter, 12973 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5682 SdHoareTripleChecker+Valid, 17288 SdHoareTripleChecker+Invalid, 2557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:17:23,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5682 Valid, 17288 Invalid, 2557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 22:17:23,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3272 states. [2024-11-11 22:17:23,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3272 to 2965. [2024-11-11 22:17:23,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2899 states have (on average 1.7878578820282855) internal successors, (5183), 2903 states have internal predecessors, (5183), 51 states have call successors, (51), 13 states have call predecessors, (51), 13 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2024-11-11 22:17:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 5286 transitions. [2024-11-11 22:17:23,739 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 5286 transitions. Word has length 190 [2024-11-11 22:17:23,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:17:23,739 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 5286 transitions. [2024-11-11 22:17:23,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:17:23,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 5286 transitions. [2024-11-11 22:17:23,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:17:23,741 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:17:23,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:17:23,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:17:23,742 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:17:23,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:17:23,742 INFO L85 PathProgramCache]: Analyzing trace with hash -814033866, now seen corresponding path program 1 times [2024-11-11 22:17:23,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:17:23,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359754243] [2024-11-11 22:17:23,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:17:23,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:17:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:23,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:17:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:23,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:17:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:24,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:17:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:24,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:17:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:24,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:17:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:17:24,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:17:24,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359754243] [2024-11-11 22:17:24,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359754243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:17:24,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:17:24,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:17:24,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109651578] [2024-11-11 22:17:24,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:17:24,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:17:24,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:17:24,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:17:24,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:17:24,089 INFO L87 Difference]: Start difference. First operand 2965 states and 5286 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:17:28,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:17:28,275 INFO L93 Difference]: Finished difference Result 4690 states and 8068 transitions. [2024-11-11 22:17:28,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:17:28,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:17:28,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:17:28,291 INFO L225 Difference]: With dead ends: 4690 [2024-11-11 22:17:28,291 INFO L226 Difference]: Without dead ends: 3867 [2024-11-11 22:17:28,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:17:28,296 INFO L435 NwaCegarLoop]: 4594 mSDtfsCounter, 5707 mSDsluCounter, 18038 mSDsCounter, 0 mSdLazyCounter, 3860 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5727 SdHoareTripleChecker+Valid, 22632 SdHoareTripleChecker+Invalid, 3927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:17:28,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5727 Valid, 22632 Invalid, 3927 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 3860 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-11 22:17:28,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3867 states. [2024-11-11 22:17:28,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3867 to 3357. [2024-11-11 22:17:28,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 3262 states have (on average 1.7614960147148988) internal successors, (5746), 3267 states have internal predecessors, (5746), 73 states have call successors, (73), 19 states have call predecessors, (73), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-11-11 22:17:28,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 5895 transitions. [2024-11-11 22:17:28,429 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 5895 transitions. Word has length 190 [2024-11-11 22:17:28,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:17:28,429 INFO L471 AbstractCegarLoop]: Abstraction has 3357 states and 5895 transitions. [2024-11-11 22:17:28,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:17:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 5895 transitions. [2024-11-11 22:17:28,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:17:28,432 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:17:28,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:17:28,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:17:28,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:17:28,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:17:28,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1557683000, now seen corresponding path program 1 times [2024-11-11 22:17:28,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:17:28,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970557710] [2024-11-11 22:17:28,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:17:28,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:17:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:28,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:17:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:28,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:17:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:28,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:17:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:28,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:17:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:28,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:17:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:28,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:17:28,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:17:28,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970557710] [2024-11-11 22:17:28,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970557710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:17:28,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:17:28,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:17:28,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123497126] [2024-11-11 22:17:28,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:17:28,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:17:28,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:17:28,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:17:28,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:17:28,757 INFO L87 Difference]: Start difference. First operand 3357 states and 5895 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:17:32,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:17:32,894 INFO L93 Difference]: Finished difference Result 6188 states and 10453 transitions. [2024-11-11 22:17:32,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:17:32,899 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:17:32,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:17:32,922 INFO L225 Difference]: With dead ends: 6188 [2024-11-11 22:17:32,925 INFO L226 Difference]: Without dead ends: 4973 [2024-11-11 22:17:32,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:17:32,934 INFO L435 NwaCegarLoop]: 4592 mSDtfsCounter, 5701 mSDsluCounter, 18038 mSDsCounter, 0 mSdLazyCounter, 3839 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5721 SdHoareTripleChecker+Valid, 22630 SdHoareTripleChecker+Invalid, 3908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:17:32,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5721 Valid, 22630 Invalid, 3908 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [69 Valid, 3839 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-11 22:17:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4973 states. [2024-11-11 22:17:33,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4973 to 4145. [2024-11-11 22:17:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4145 states, 3992 states have (on average 1.7231963927855711) internal successors, (6879), 3999 states have internal predecessors, (6879), 117 states have call successors, (117), 31 states have call predecessors, (117), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-11-11 22:17:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 7124 transitions. [2024-11-11 22:17:33,125 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 7124 transitions. Word has length 190 [2024-11-11 22:17:33,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:17:33,125 INFO L471 AbstractCegarLoop]: Abstraction has 4145 states and 7124 transitions. [2024-11-11 22:17:33,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:17:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 7124 transitions. [2024-11-11 22:17:33,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:17:33,128 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:17:33,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:17:33,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:17:33,129 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:17:33,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:17:33,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2056239802, now seen corresponding path program 1 times [2024-11-11 22:17:33,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:17:33,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276514153] [2024-11-11 22:17:33,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:17:33,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:17:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:33,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:17:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:33,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:17:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:33,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:17:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:33,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:17:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:33,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:17:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:17:33,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:17:33,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276514153] [2024-11-11 22:17:33,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276514153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:17:33,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:17:33,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:17:33,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278010312] [2024-11-11 22:17:33,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:17:33,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:17:33,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:17:33,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:17:33,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:17:33,721 INFO L87 Difference]: Start difference. First operand 4145 states and 7124 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:17:37,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:17:37,800 INFO L93 Difference]: Finished difference Result 9078 states and 15022 transitions. [2024-11-11 22:17:37,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:17:37,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:17:37,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:17:37,829 INFO L225 Difference]: With dead ends: 9078 [2024-11-11 22:17:37,833 INFO L226 Difference]: Without dead ends: 7075 [2024-11-11 22:17:37,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:17:37,844 INFO L435 NwaCegarLoop]: 4592 mSDtfsCounter, 5700 mSDsluCounter, 18038 mSDsCounter, 0 mSdLazyCounter, 3826 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5720 SdHoareTripleChecker+Valid, 22630 SdHoareTripleChecker+Invalid, 3895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:17:37,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5720 Valid, 22630 Invalid, 3895 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [69 Valid, 3826 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 22:17:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7075 states. [2024-11-11 22:17:38,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7075 to 5722. [2024-11-11 22:17:38,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5722 states, 5453 states have (on average 1.6770584999083074) internal successors, (9145), 5464 states have internal predecessors, (9145), 205 states have call successors, (205), 55 states have call predecessors, (205), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-11-11 22:17:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5722 states to 5722 states and 9588 transitions. [2024-11-11 22:17:38,032 INFO L78 Accepts]: Start accepts. Automaton has 5722 states and 9588 transitions. Word has length 190 [2024-11-11 22:17:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:17:38,033 INFO L471 AbstractCegarLoop]: Abstraction has 5722 states and 9588 transitions. [2024-11-11 22:17:38,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:17:38,034 INFO L276 IsEmpty]: Start isEmpty. Operand 5722 states and 9588 transitions. [2024-11-11 22:17:38,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:17:38,036 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:17:38,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:17:38,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:17:38,037 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:17:38,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:17:38,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1668455688, now seen corresponding path program 1 times [2024-11-11 22:17:38,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:17:38,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070649062] [2024-11-11 22:17:38,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:17:38,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:17:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:38,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:17:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:38,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:17:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:38,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:17:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:38,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:17:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:38,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:17:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:17:38,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:17:38,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070649062] [2024-11-11 22:17:38,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070649062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:17:38,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:17:38,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:17:38,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812285523] [2024-11-11 22:17:38,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:17:38,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:17:38,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:17:38,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:17:38,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:17:38,269 INFO L87 Difference]: Start difference. First operand 5722 states and 9588 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:17:42,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:17:42,153 INFO L93 Difference]: Finished difference Result 14857 states and 24176 transitions. [2024-11-11 22:17:42,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:17:42,153 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:17:42,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:17:42,185 INFO L225 Difference]: With dead ends: 14857 [2024-11-11 22:17:42,185 INFO L226 Difference]: Without dead ends: 11277 [2024-11-11 22:17:42,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:17:42,197 INFO L435 NwaCegarLoop]: 4592 mSDtfsCounter, 5699 mSDsluCounter, 18038 mSDsCounter, 0 mSdLazyCounter, 3813 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5719 SdHoareTripleChecker+Valid, 22630 SdHoareTripleChecker+Invalid, 3882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:17:42,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5719 Valid, 22630 Invalid, 3882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3813 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 22:17:42,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11277 states. [2024-11-11 22:17:42,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11277 to 8883. [2024-11-11 22:17:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8883 states, 8382 states have (on average 1.6329038415652588) internal successors, (13687), 8401 states have internal predecessors, (13687), 381 states have call successors, (381), 103 states have call predecessors, (381), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-11-11 22:17:42,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8883 states to 8883 states and 14544 transitions. [2024-11-11 22:17:42,487 INFO L78 Accepts]: Start accepts. Automaton has 8883 states and 14544 transitions. Word has length 190 [2024-11-11 22:17:42,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:17:42,488 INFO L471 AbstractCegarLoop]: Abstraction has 8883 states and 14544 transitions. [2024-11-11 22:17:42,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:17:42,489 INFO L276 IsEmpty]: Start isEmpty. Operand 8883 states and 14544 transitions. [2024-11-11 22:17:42,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:17:42,493 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:17:42,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:17:42,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:17:42,494 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:17:42,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:17:42,494 INFO L85 PathProgramCache]: Analyzing trace with hash -264586502, now seen corresponding path program 1 times [2024-11-11 22:17:42,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:17:42,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832061170] [2024-11-11 22:17:42,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:17:42,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:17:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:42,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:17:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:42,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:17:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:42,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:17:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:42,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:17:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:42,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:17:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:17:42,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:17:42,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832061170] [2024-11-11 22:17:42,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832061170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:17:42,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:17:42,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:17:42,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19015236] [2024-11-11 22:17:42,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:17:42,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:17:42,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:17:42,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:17:42,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:17:42,734 INFO L87 Difference]: Start difference. First operand 8883 states and 14544 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:17:46,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:17:46,559 INFO L93 Difference]: Finished difference Result 26416 states and 42546 transitions. [2024-11-11 22:17:46,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:17:46,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:17:46,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:17:46,613 INFO L225 Difference]: With dead ends: 26416 [2024-11-11 22:17:46,614 INFO L226 Difference]: Without dead ends: 19675 [2024-11-11 22:17:46,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:17:46,634 INFO L435 NwaCegarLoop]: 4325 mSDtfsCounter, 5812 mSDsluCounter, 17262 mSDsCounter, 0 mSdLazyCounter, 3248 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5832 SdHoareTripleChecker+Valid, 21587 SdHoareTripleChecker+Invalid, 3359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:17:46,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5832 Valid, 21587 Invalid, 3359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3248 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 22:17:46,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19675 states. [2024-11-11 22:17:47,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19675 to 15220. [2024-11-11 22:17:47,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15220 states, 14255 states have (on average 1.5989477376359171) internal successors, (22793), 14290 states have internal predecessors, (22793), 733 states have call successors, (733), 199 states have call predecessors, (733), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-11-11 22:17:47,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15220 states to 15220 states and 24532 transitions. [2024-11-11 22:17:47,174 INFO L78 Accepts]: Start accepts. Automaton has 15220 states and 24532 transitions. Word has length 190 [2024-11-11 22:17:47,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:17:47,175 INFO L471 AbstractCegarLoop]: Abstraction has 15220 states and 24532 transitions. [2024-11-11 22:17:47,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:17:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 15220 states and 24532 transitions. [2024-11-11 22:17:47,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:17:47,183 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:17:47,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:17:47,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:17:47,184 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:17:47,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:17:47,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1050584392, now seen corresponding path program 1 times [2024-11-11 22:17:47,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:17:47,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119604404] [2024-11-11 22:17:47,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:17:47,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:17:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:47,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:17:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:47,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:17:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:47,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:17:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:47,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:17:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:47,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:17:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:47,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:17:47,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:17:47,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119604404] [2024-11-11 22:17:47,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119604404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:17:47,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:17:47,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:17:47,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541657164] [2024-11-11 22:17:47,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:17:47,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:17:47,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:17:47,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:17:47,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:17:47,413 INFO L87 Difference]: Start difference. First operand 15220 states and 24532 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:17:49,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:17:49,885 INFO L93 Difference]: Finished difference Result 33032 states and 53297 transitions. [2024-11-11 22:17:49,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:17:49,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:17:49,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:17:49,948 INFO L225 Difference]: With dead ends: 33032 [2024-11-11 22:17:49,948 INFO L226 Difference]: Without dead ends: 19954 [2024-11-11 22:17:49,980 INFO L434 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-11-11 22:17:49,981 INFO L435 NwaCegarLoop]: 4300 mSDtfsCounter, 5208 mSDsluCounter, 16916 mSDsCounter, 0 mSdLazyCounter, 1951 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5229 SdHoareTripleChecker+Valid, 21216 SdHoareTripleChecker+Invalid, 2022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:17:49,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5229 Valid, 21216 Invalid, 2022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1951 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 22:17:49,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19954 states. [2024-11-11 22:17:50,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19954 to 15220. [2024-11-11 22:17:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15220 states, 14255 states have (on average 1.596632760434935) internal successors, (22760), 14290 states have internal predecessors, (22760), 733 states have call successors, (733), 199 states have call predecessors, (733), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-11-11 22:17:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15220 states to 15220 states and 24499 transitions. [2024-11-11 22:17:50,584 INFO L78 Accepts]: Start accepts. Automaton has 15220 states and 24499 transitions. Word has length 190 [2024-11-11 22:17:50,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:17:50,584 INFO L471 AbstractCegarLoop]: Abstraction has 15220 states and 24499 transitions. [2024-11-11 22:17:50,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:17:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 15220 states and 24499 transitions. [2024-11-11 22:17:50,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:17:50,592 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:17:50,592 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:17:50,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:17:50,593 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:17:50,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:17:50,593 INFO L85 PathProgramCache]: Analyzing trace with hash -383202502, now seen corresponding path program 1 times [2024-11-11 22:17:50,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:17:50,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866801985] [2024-11-11 22:17:50,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:17:50,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:17:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:50,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:17:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:50,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:17:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:50,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:17:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:50,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:17:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:50,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:17:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:17:50,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:17:50,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866801985] [2024-11-11 22:17:50,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866801985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:17:50,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:17:50,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:17:50,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663704420] [2024-11-11 22:17:50,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:17:50,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:17:50,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:17:50,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:17:50,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:17:50,820 INFO L87 Difference]: Start difference. First operand 15220 states and 24499 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:17:55,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:17:55,650 INFO L93 Difference]: Finished difference Result 49501 states and 79248 transitions. [2024-11-11 22:17:55,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:17:55,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:17:55,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:17:55,757 INFO L225 Difference]: With dead ends: 49501 [2024-11-11 22:17:55,758 INFO L226 Difference]: Without dead ends: 36423 [2024-11-11 22:17:55,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:17:55,798 INFO L435 NwaCegarLoop]: 4592 mSDtfsCounter, 5690 mSDsluCounter, 18038 mSDsCounter, 0 mSdLazyCounter, 3762 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5710 SdHoareTripleChecker+Valid, 22630 SdHoareTripleChecker+Invalid, 3831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:17:55,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5710 Valid, 22630 Invalid, 3831 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [69 Valid, 3762 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 22:17:55,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36423 states. [2024-11-11 22:17:56,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36423 to 27958. [2024-11-11 22:17:57,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27958 states, 26065 states have (on average 1.5737579129100325) internal successors, (41020), 26132 states have internal predecessors, (41020), 1437 states have call successors, (1437), 391 states have call predecessors, (1437), 454 states have return successors, (2228), 1498 states have call predecessors, (2228), 1435 states have call successors, (2228) [2024-11-11 22:17:57,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27958 states to 27958 states and 44685 transitions. [2024-11-11 22:17:57,091 INFO L78 Accepts]: Start accepts. Automaton has 27958 states and 44685 transitions. Word has length 190 [2024-11-11 22:17:57,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:17:57,094 INFO L471 AbstractCegarLoop]: Abstraction has 27958 states and 44685 transitions. [2024-11-11 22:17:57,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:17:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 27958 states and 44685 transitions. [2024-11-11 22:17:57,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:17:57,106 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:17:57,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:17:57,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:17:57,107 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:17:57,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:17:57,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1716535928, now seen corresponding path program 1 times [2024-11-11 22:17:57,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:17:57,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022371505] [2024-11-11 22:17:57,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:17:57,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:17:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:57,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:17:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:57,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:17:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:57,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:17:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:57,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:17:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:57,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:17:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:17:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:17:57,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:17:57,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022371505] [2024-11-11 22:17:57,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022371505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:17:57,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:17:57,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:17:57,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524690706] [2024-11-11 22:17:57,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:17:57,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:17:57,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:17:57,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:17:57,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:17:57,328 INFO L87 Difference]: Start difference. First operand 27958 states and 44685 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:18:03,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:18:03,220 INFO L93 Difference]: Finished difference Result 95741 states and 153528 transitions. [2024-11-11 22:18:03,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:18:03,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:18:03,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:18:03,426 INFO L225 Difference]: With dead ends: 95741 [2024-11-11 22:18:03,426 INFO L226 Difference]: Without dead ends: 69925 [2024-11-11 22:18:03,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:18:03,491 INFO L435 NwaCegarLoop]: 4592 mSDtfsCounter, 5695 mSDsluCounter, 18038 mSDsCounter, 0 mSdLazyCounter, 3744 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5715 SdHoareTripleChecker+Valid, 22630 SdHoareTripleChecker+Invalid, 3813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:18:03,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5715 Valid, 22630 Invalid, 3813 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [69 Valid, 3744 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-11 22:18:03,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69925 states. [2024-11-11 22:18:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69925 to 53495. [2024-11-11 22:18:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53495 states, 49746 states have (on average 1.5605274795963495) internal successors, (77630), 49877 states have internal predecessors, (77630), 2845 states have call successors, (2845), 775 states have call predecessors, (2845), 902 states have return successors, (5158), 2970 states have call predecessors, (5158), 2843 states have call successors, (5158) [2024-11-11 22:18:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53495 states to 53495 states and 85633 transitions. [2024-11-11 22:18:06,423 INFO L78 Accepts]: Start accepts. Automaton has 53495 states and 85633 transitions. Word has length 190 [2024-11-11 22:18:06,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:18:06,423 INFO L471 AbstractCegarLoop]: Abstraction has 53495 states and 85633 transitions. [2024-11-11 22:18:06,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:18:06,424 INFO L276 IsEmpty]: Start isEmpty. Operand 53495 states and 85633 transitions. [2024-11-11 22:18:06,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:18:06,446 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:18:06,446 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:18:06,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:18:06,447 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:18:06,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:18:06,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2061364090, now seen corresponding path program 1 times [2024-11-11 22:18:06,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:18:06,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354619219] [2024-11-11 22:18:06,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:18:06,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:18:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:18:06,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:18:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:18:06,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:18:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:18:06,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:18:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:18:06,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:18:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:18:06,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:18:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:18:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:18:06,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:18:06,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354619219] [2024-11-11 22:18:06,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354619219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:18:06,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:18:06,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:18:06,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238687730] [2024-11-11 22:18:06,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:18:06,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:18:06,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:18:06,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:18:06,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:18:06,641 INFO L87 Difference]: Start difference. First operand 53495 states and 85633 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:18:11,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:18:11,569 INFO L93 Difference]: Finished difference Result 122246 states and 198418 transitions. [2024-11-11 22:18:11,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:18:11,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:18:11,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:18:11,814 INFO L225 Difference]: With dead ends: 122246 [2024-11-11 22:18:11,815 INFO L226 Difference]: Without dead ends: 70893 [2024-11-11 22:18:11,933 INFO L434 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-11-11 22:18:11,934 INFO L435 NwaCegarLoop]: 4300 mSDtfsCounter, 5391 mSDsluCounter, 12729 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5412 SdHoareTripleChecker+Valid, 17029 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:18:11,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5412 Valid, 17029 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 22:18:11,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70893 states. [2024-11-11 22:18:14,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70893 to 53495. [2024-11-11 22:18:14,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53495 states, 49746 states have (on average 1.5579343062758815) internal successors, (77501), 49877 states have internal predecessors, (77501), 2845 states have call successors, (2845), 775 states have call predecessors, (2845), 902 states have return successors, (5158), 2970 states have call predecessors, (5158), 2843 states have call successors, (5158) [2024-11-11 22:18:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53495 states to 53495 states and 85504 transitions. [2024-11-11 22:18:15,117 INFO L78 Accepts]: Start accepts. Automaton has 53495 states and 85504 transitions. Word has length 190 [2024-11-11 22:18:15,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:18:15,117 INFO L471 AbstractCegarLoop]: Abstraction has 53495 states and 85504 transitions. [2024-11-11 22:18:15,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:18:15,117 INFO L276 IsEmpty]: Start isEmpty. Operand 53495 states and 85504 transitions. [2024-11-11 22:18:15,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-11 22:18:15,148 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:18:15,149 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:18:15,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:18:15,149 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:18:15,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:18:15,149 INFO L85 PathProgramCache]: Analyzing trace with hash 291892476, now seen corresponding path program 1 times [2024-11-11 22:18:15,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:18:15,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868279428] [2024-11-11 22:18:15,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:18:15,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:18:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:18:15,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:18:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:18:15,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:18:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:18:15,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 22:18:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:18:15,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 22:18:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:18:15,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 22:18:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:18:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:18:15,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:18:15,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868279428] [2024-11-11 22:18:15,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868279428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:18:15,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:18:15,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:18:15,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814167149] [2024-11-11 22:18:15,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:18:15,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:18:15,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:18:15,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:18:15,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:18:15,428 INFO L87 Difference]: Start difference. First operand 53495 states and 85504 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:18:24,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:18:24,854 INFO L93 Difference]: Finished difference Result 187960 states and 302770 transitions. [2024-11-11 22:18:24,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:18:24,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 190 [2024-11-11 22:18:24,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:18:25,584 INFO L225 Difference]: With dead ends: 187960 [2024-11-11 22:18:25,584 INFO L226 Difference]: Without dead ends: 136607