./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.14.cil.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_label45+token_ring.14.cil.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 5c885e36ce67f972719c7330e2fdf8e1794f0d30dd144b261109fa7b0892a972 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:14:59,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:14:59,212 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:14:59,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:14:59,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:14:59,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:14:59,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:14:59,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:14:59,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:14:59,252 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:14:59,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:14:59,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:14:59,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:14:59,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:14:59,253 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:14:59,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:14:59,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:14:59,256 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:14:59,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:14:59,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:14:59,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:14:59,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:14:59,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:14:59,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:14:59,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:14:59,260 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:14:59,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:14:59,260 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:14:59,260 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:14:59,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:14:59,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:14:59,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:14:59,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:14:59,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:14:59,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:14:59,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:14:59,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:14:59,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:14:59,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:14:59,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:14:59,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:14:59,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:14:59,263 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 -> 5c885e36ce67f972719c7330e2fdf8e1794f0d30dd144b261109fa7b0892a972 [2024-11-11 22:14:59,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:14:59,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:14:59,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:14:59,510 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:14:59,511 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:14:59,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.14.cil.c [2024-11-11 22:15:00,752 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:15:01,249 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:15:01,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.14.cil.c [2024-11-11 22:15:01,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/963d3e409/f5d23f9abd814eca8da4d2af62f470c0/FLAG990d39d05 [2024-11-11 22:15:01,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/963d3e409/f5d23f9abd814eca8da4d2af62f470c0 [2024-11-11 22:15:01,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:15:01,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:15:01,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:15:01,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:15:01,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:15:01,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:15:01" (1/1) ... [2024-11-11 22:15:01,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3184c39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:15:01, skipping insertion in model container [2024-11-11 22:15:01,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:15:01" (1/1) ... [2024-11-11 22:15:01,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:15:02,699 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_label45+token_ring.14.cil.c[380323,380336] [2024-11-11 22:15:02,721 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_label45+token_ring.14.cil.c[383339,383352] [2024-11-11 22:15:02,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:15:02,974 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:15:03,566 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_label45+token_ring.14.cil.c[380323,380336] [2024-11-11 22:15:03,573 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_label45+token_ring.14.cil.c[383339,383352] [2024-11-11 22:15:03,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:15:03,702 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:15:03,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:15:03 WrapperNode [2024-11-11 22:15:03,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:15:03,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:15:03,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:15:03,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:15:03,712 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:15:03" (1/1) ... [2024-11-11 22:15:03,801 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:15:03" (1/1) ... [2024-11-11 22:15:04,096 INFO L138 Inliner]: procedures = 68, calls = 78, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 13237 [2024-11-11 22:15:04,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:15:04,097 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:15:04,097 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:15:04,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:15:04,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:15:03" (1/1) ... [2024-11-11 22:15:04,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:15:03" (1/1) ... [2024-11-11 22:15:04,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:15:03" (1/1) ... [2024-11-11 22:15:04,307 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:15:04,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:15:03" (1/1) ... [2024-11-11 22:15:04,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:15:03" (1/1) ... [2024-11-11 22:15:04,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:15:03" (1/1) ... [2024-11-11 22:15:04,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:15:03" (1/1) ... [2024-11-11 22:15:04,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:15:03" (1/1) ... [2024-11-11 22:15:04,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:15:03" (1/1) ... [2024-11-11 22:15:04,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:15:04,574 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:15:04,574 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:15:04,574 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:15:04,575 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:15:03" (1/1) ... [2024-11-11 22:15:04,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:15:04,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:15:04,607 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:15:04,609 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:15:04,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:15:04,650 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-11 22:15:04,650 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-11 22:15:04,650 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:15:04,651 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:15:04,652 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-11 22:15:04,652 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-11 22:15:04,652 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-11 22:15:04,652 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-11 22:15:04,652 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-11 22:15:04,652 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-11 22:15:04,652 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-11 22:15:04,652 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-11 22:15:04,652 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-11 22:15:04,653 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-11 22:15:04,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:15:04,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:15:04,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:15:04,782 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:15:04,784 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:15:10,933 INFO L? ?]: Removed 1759 outVars from TransFormulas that were not future-live. [2024-11-11 22:15:10,933 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:15:10,984 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:15:10,985 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-11 22:15:10,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:15:10 BoogieIcfgContainer [2024-11-11 22:15:10,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:15:10,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:15:10,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:15:10,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:15:10,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:15:01" (1/3) ... [2024-11-11 22:15:10,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728e2ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:15:10, skipping insertion in model container [2024-11-11 22:15:10,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:15:03" (2/3) ... [2024-11-11 22:15:10,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@728e2ea9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:15:10, skipping insertion in model container [2024-11-11 22:15:10,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:15:10" (3/3) ... [2024-11-11 22:15:10,995 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.14.cil.c [2024-11-11 22:15:11,009 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:15:11,009 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:15:11,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:15:11,115 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;@7de53edb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:15:11,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:15:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 2584 states, 2546 states have (on average 1.8389630793401415) internal successors, (4682), 2551 states have internal predecessors, (4682), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-11 22:15:11,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:15:11,141 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:15:11,141 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] [2024-11-11 22:15:11,142 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:15:11,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:15:11,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1563326470, now seen corresponding path program 1 times [2024-11-11 22:15:11,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:15:11,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598697931] [2024-11-11 22:15:11,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:15:11,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:15:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:11,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:15:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:11,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:15:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:11,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:15:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:11,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:15:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:11,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:15:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:11,687 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:15:11,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:15:11,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598697931] [2024-11-11 22:15:11,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598697931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:15:11,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:15:11,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:15:11,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454896756] [2024-11-11 22:15:11,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:15:11,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:15:11,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:15:11,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:15:11,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:15:11,723 INFO L87 Difference]: Start difference. First operand has 2584 states, 2546 states have (on average 1.8389630793401415) internal successors, (4682), 2551 states have internal predecessors, (4682), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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:15:13,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:15:13,472 INFO L93 Difference]: Finished difference Result 5303 states and 9710 transitions. [2024-11-11 22:15:13,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:15:13,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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 179 [2024-11-11 22:15:13,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:15:13,493 INFO L225 Difference]: With dead ends: 5303 [2024-11-11 22:15:13,494 INFO L226 Difference]: Without dead ends: 2658 [2024-11-11 22:15:13,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:15:13,504 INFO L435 NwaCegarLoop]: 4390 mSDtfsCounter, 1061 mSDsluCounter, 12501 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 16891 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:15:13,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 16891 Invalid, 1097 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 22:15:13,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2024-11-11 22:15:13,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2516. [2024-11-11 22:15:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2516 states, 2480 states have (on average 1.8221774193548388) internal successors, (4519), 2483 states have internal predecessors, (4519), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-11 22:15:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 4573 transitions. [2024-11-11 22:15:13,644 INFO L78 Accepts]: Start accepts. Automaton has 2516 states and 4573 transitions. Word has length 179 [2024-11-11 22:15:13,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:15:13,645 INFO L471 AbstractCegarLoop]: Abstraction has 2516 states and 4573 transitions. [2024-11-11 22:15:13,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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:15:13,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 4573 transitions. [2024-11-11 22:15:13,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:15:13,649 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:15:13,649 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] [2024-11-11 22:15:13,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:15:13,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:15:13,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:15:13,651 INFO L85 PathProgramCache]: Analyzing trace with hash -60228164, now seen corresponding path program 1 times [2024-11-11 22:15:13,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:15:13,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624041253] [2024-11-11 22:15:13,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:15:13,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:15:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:13,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:15:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:13,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:15:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:13,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:15:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:13,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:15:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:13,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:15:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:13,934 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:15:13,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:15:13,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624041253] [2024-11-11 22:15:13,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624041253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:15:13,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:15:13,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:15:13,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269109117] [2024-11-11 22:15:13,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:15:13,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:15:13,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:15:13,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:15:13,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:15:13,940 INFO L87 Difference]: Start difference. First operand 2516 states and 4573 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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:15:15,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:15:15,545 INFO L93 Difference]: Finished difference Result 3038 states and 5408 transitions. [2024-11-11 22:15:15,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:15:15,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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 179 [2024-11-11 22:15:15,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:15:15,556 INFO L225 Difference]: With dead ends: 3038 [2024-11-11 22:15:15,556 INFO L226 Difference]: Without dead ends: 2658 [2024-11-11 22:15:15,558 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:15:15,559 INFO L435 NwaCegarLoop]: 4320 mSDtfsCounter, 1047 mSDsluCounter, 12298 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 16618 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:15:15,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 16618 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 22:15:15,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2024-11-11 22:15:15,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2516. [2024-11-11 22:15:15,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2516 states, 2480 states have (on average 1.821774193548387) internal successors, (4518), 2483 states have internal predecessors, (4518), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-11 22:15:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 4572 transitions. [2024-11-11 22:15:15,621 INFO L78 Accepts]: Start accepts. Automaton has 2516 states and 4572 transitions. Word has length 179 [2024-11-11 22:15:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:15:15,622 INFO L471 AbstractCegarLoop]: Abstraction has 2516 states and 4572 transitions. [2024-11-11 22:15:15,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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:15:15,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 4572 transitions. [2024-11-11 22:15:15,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:15:15,624 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:15:15,625 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] [2024-11-11 22:15:15,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:15:15,625 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:15:15,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:15:15,626 INFO L85 PathProgramCache]: Analyzing trace with hash -630499970, now seen corresponding path program 1 times [2024-11-11 22:15:15,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:15:15,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381255609] [2024-11-11 22:15:15,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:15:15,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:15:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:15,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:15:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:15,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:15:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:15,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:15:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:15,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:15:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:15,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:15:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:15,900 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:15:15,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:15:15,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381255609] [2024-11-11 22:15:15,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381255609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:15:15,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:15:15,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:15:15,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29561170] [2024-11-11 22:15:15,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:15:15,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:15:15,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:15:15,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:15:15,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:15:15,903 INFO L87 Difference]: Start difference. First operand 2516 states and 4572 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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:15:18,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:15:18,205 INFO L93 Difference]: Finished difference Result 3568 states and 6261 transitions. [2024-11-11 22:15:18,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:15:18,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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 179 [2024-11-11 22:15:18,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:15:18,216 INFO L225 Difference]: With dead ends: 3568 [2024-11-11 22:15:18,216 INFO L226 Difference]: Without dead ends: 3193 [2024-11-11 22:15:18,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:15:18,220 INFO L435 NwaCegarLoop]: 4290 mSDtfsCounter, 5542 mSDsluCounter, 12890 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5561 SdHoareTripleChecker+Valid, 17180 SdHoareTripleChecker+Invalid, 2385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:15:18,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5561 Valid, 17180 Invalid, 2385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-11 22:15:18,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2024-11-11 22:15:18,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 2908. [2024-11-11 22:15:18,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2908 states, 2844 states have (on average 1.7907876230661042) internal successors, (5093), 2848 states have internal predecessors, (5093), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-11-11 22:15:18,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 5192 transitions. [2024-11-11 22:15:18,304 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 5192 transitions. Word has length 179 [2024-11-11 22:15:18,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:15:18,304 INFO L471 AbstractCegarLoop]: Abstraction has 2908 states and 5192 transitions. [2024-11-11 22:15:18,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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:15:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 5192 transitions. [2024-11-11 22:15:18,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:15:18,306 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:15:18,306 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] [2024-11-11 22:15:18,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:15:18,307 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:15:18,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:15:18,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2016239750, now seen corresponding path program 1 times [2024-11-11 22:15:18,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:15:18,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92042894] [2024-11-11 22:15:18,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:15:18,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:15:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:18,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:15:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:18,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:15:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:18,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:15:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:18,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:15:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:18,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:15:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:18,531 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:15:18,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:15:18,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92042894] [2024-11-11 22:15:18,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92042894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:15:18,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:15:18,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:15:18,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214562309] [2024-11-11 22:15:18,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:15:18,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:15:18,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:15:18,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:15:18,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:15:18,533 INFO L87 Difference]: Start difference. First operand 2908 states and 5192 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:15:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:15:21,585 INFO L93 Difference]: Finished difference Result 4513 states and 7773 transitions. [2024-11-11 22:15:21,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:15:21,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:15:21,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:15:21,599 INFO L225 Difference]: With dead ends: 4513 [2024-11-11 22:15:21,599 INFO L226 Difference]: Without dead ends: 3746 [2024-11-11 22:15:21,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:15:21,604 INFO L435 NwaCegarLoop]: 4548 mSDtfsCounter, 5575 mSDsluCounter, 17865 mSDsCounter, 0 mSdLazyCounter, 3597 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5594 SdHoareTripleChecker+Valid, 22413 SdHoareTripleChecker+Invalid, 3662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:15:21,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5594 Valid, 22413 Invalid, 3662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3597 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-11 22:15:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2024-11-11 22:15:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 3273. [2024-11-11 22:15:21,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3273 states, 3181 states have (on average 1.7648538195535994) internal successors, (5614), 3186 states have internal predecessors, (5614), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-11-11 22:15:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 5757 transitions. [2024-11-11 22:15:21,681 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 5757 transitions. Word has length 179 [2024-11-11 22:15:21,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:15:21,681 INFO L471 AbstractCegarLoop]: Abstraction has 3273 states and 5757 transitions. [2024-11-11 22:15:21,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:15:21,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 5757 transitions. [2024-11-11 22:15:21,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:15:21,683 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:15:21,683 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] [2024-11-11 22:15:21,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:15:21,683 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:15:21,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:15:21,684 INFO L85 PathProgramCache]: Analyzing trace with hash 509255932, now seen corresponding path program 1 times [2024-11-11 22:15:21,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:15:21,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100491697] [2024-11-11 22:15:21,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:15:21,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:15:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:21,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:15:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:21,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:15:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:21,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:15:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:21,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:15:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:21,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:15:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:21,899 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:15:21,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:15:21,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100491697] [2024-11-11 22:15:21,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100491697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:15:21,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:15:21,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:15:21,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117165569] [2024-11-11 22:15:21,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:15:21,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:15:21,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:15:21,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:15:21,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:15:21,901 INFO L87 Difference]: Start difference. First operand 3273 states and 5757 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:15:24,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:15:24,693 INFO L93 Difference]: Finished difference Result 5907 states and 9984 transitions. [2024-11-11 22:15:24,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:15:24,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:15:24,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:15:24,709 INFO L225 Difference]: With dead ends: 5907 [2024-11-11 22:15:24,709 INFO L226 Difference]: Without dead ends: 4775 [2024-11-11 22:15:24,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:15:24,713 INFO L435 NwaCegarLoop]: 4300 mSDtfsCounter, 5689 mSDsluCounter, 17155 mSDsCounter, 0 mSdLazyCounter, 3058 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5708 SdHoareTripleChecker+Valid, 21455 SdHoareTripleChecker+Invalid, 3165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:15:24,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5708 Valid, 21455 Invalid, 3165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 3058 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 22:15:24,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4775 states. [2024-11-11 22:15:24,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4775 to 4004. [2024-11-11 22:15:24,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4004 states, 3856 states have (on average 1.7264004149377594) internal successors, (6657), 3863 states have internal predecessors, (6657), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-11-11 22:15:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4004 states to 4004 states and 6892 transitions. [2024-11-11 22:15:24,809 INFO L78 Accepts]: Start accepts. Automaton has 4004 states and 6892 transitions. Word has length 179 [2024-11-11 22:15:24,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:15:24,810 INFO L471 AbstractCegarLoop]: Abstraction has 4004 states and 6892 transitions. [2024-11-11 22:15:24,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:15:24,810 INFO L276 IsEmpty]: Start isEmpty. Operand 4004 states and 6892 transitions. [2024-11-11 22:15:24,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:15:24,812 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:15:24,812 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] [2024-11-11 22:15:24,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:15:24,812 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:15:24,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:15:24,813 INFO L85 PathProgramCache]: Analyzing trace with hash -102013126, now seen corresponding path program 1 times [2024-11-11 22:15:24,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:15:24,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635822848] [2024-11-11 22:15:24,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:15:24,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:15:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:24,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:15:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:24,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:15:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:25,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:15:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:25,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:15:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:25,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:15:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:25,031 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:15:25,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:15:25,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635822848] [2024-11-11 22:15:25,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635822848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:15:25,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:15:25,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:15:25,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943953515] [2024-11-11 22:15:25,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:15:25,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:15:25,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:15:25,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:15:25,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:15:25,034 INFO L87 Difference]: Start difference. First operand 4004 states and 6892 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:15:28,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:15:28,313 INFO L93 Difference]: Finished difference Result 8590 states and 14211 transitions. [2024-11-11 22:15:28,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:15:28,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:15:28,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:15:28,347 INFO L225 Difference]: With dead ends: 8590 [2024-11-11 22:15:28,347 INFO L226 Difference]: Without dead ends: 6727 [2024-11-11 22:15:28,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:15:28,357 INFO L435 NwaCegarLoop]: 4546 mSDtfsCounter, 5573 mSDsluCounter, 17865 mSDsCounter, 0 mSdLazyCounter, 3586 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5592 SdHoareTripleChecker+Valid, 22411 SdHoareTripleChecker+Invalid, 3653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:15:28,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5592 Valid, 22411 Invalid, 3653 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 3586 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 22:15:28,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6727 states. [2024-11-11 22:15:28,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6727 to 5467. [2024-11-11 22:15:28,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5467 states, 5207 states have (on average 1.67908584597657) internal successors, (8743), 5218 states have internal predecessors, (8743), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-11-11 22:15:28,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5467 states to 5467 states and 9168 transitions. [2024-11-11 22:15:28,628 INFO L78 Accepts]: Start accepts. Automaton has 5467 states and 9168 transitions. Word has length 179 [2024-11-11 22:15:28,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:15:28,629 INFO L471 AbstractCegarLoop]: Abstraction has 5467 states and 9168 transitions. [2024-11-11 22:15:28,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:15:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 5467 states and 9168 transitions. [2024-11-11 22:15:28,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:15:28,633 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:15:28,633 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] [2024-11-11 22:15:28,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:15:28,634 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:15:28,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:15:28,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1507204804, now seen corresponding path program 1 times [2024-11-11 22:15:28,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:15:28,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809929484] [2024-11-11 22:15:28,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:15:28,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:15:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:28,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:15:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:28,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:15:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:28,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:15:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:28,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:15:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:28,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:15:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:28,865 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:15:28,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:15:28,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809929484] [2024-11-11 22:15:28,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809929484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:15:28,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:15:28,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:15:28,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680728048] [2024-11-11 22:15:28,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:15:28,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:15:28,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:15:28,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:15:28,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:15:28,867 INFO L87 Difference]: Start difference. First operand 5467 states and 9168 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:15:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:15:31,851 INFO L93 Difference]: Finished difference Result 13948 states and 22669 transitions. [2024-11-11 22:15:31,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:15:31,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:15:31,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:15:31,884 INFO L225 Difference]: With dead ends: 13948 [2024-11-11 22:15:31,884 INFO L226 Difference]: Without dead ends: 10622 [2024-11-11 22:15:31,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:15:31,897 INFO L435 NwaCegarLoop]: 4546 mSDtfsCounter, 5569 mSDsluCounter, 17865 mSDsCounter, 0 mSdLazyCounter, 3558 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5588 SdHoareTripleChecker+Valid, 22411 SdHoareTripleChecker+Invalid, 3625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:15:31,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5588 Valid, 22411 Invalid, 3625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3558 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 22:15:31,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10622 states. [2024-11-11 22:15:32,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10622 to 8407. [2024-11-11 22:15:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8407 states, 7923 states have (on average 1.6330935251798562) internal successors, (12939), 7942 states have internal predecessors, (12939), 364 states have call successors, (364), 103 states have call predecessors, (364), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-11-11 22:15:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8407 states to 8407 states and 13762 transitions. [2024-11-11 22:15:32,173 INFO L78 Accepts]: Start accepts. Automaton has 8407 states and 13762 transitions. Word has length 179 [2024-11-11 22:15:32,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:15:32,174 INFO L471 AbstractCegarLoop]: Abstraction has 8407 states and 13762 transitions. [2024-11-11 22:15:32,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:15:32,174 INFO L276 IsEmpty]: Start isEmpty. Operand 8407 states and 13762 transitions. [2024-11-11 22:15:32,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:15:32,178 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:15:32,178 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] [2024-11-11 22:15:32,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:15:32,179 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:15:32,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:15:32,179 INFO L85 PathProgramCache]: Analyzing trace with hash -60623938, now seen corresponding path program 1 times [2024-11-11 22:15:32,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:15:32,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913978054] [2024-11-11 22:15:32,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:15:32,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:15:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:32,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:15:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:32,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:15:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:32,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:15:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:32,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:15:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:32,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:15:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:32,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:15:32,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:15:32,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913978054] [2024-11-11 22:15:32,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913978054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:15:32,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:15:32,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:15:32,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675310803] [2024-11-11 22:15:32,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:15:32,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:15:32,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:15:32,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:15:32,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:15:32,406 INFO L87 Difference]: Start difference. First operand 8407 states and 13762 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:15:35,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:15:35,608 INFO L93 Difference]: Finished difference Result 24682 states and 39677 transitions. [2024-11-11 22:15:35,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:15:35,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:15:35,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:15:35,657 INFO L225 Difference]: With dead ends: 24682 [2024-11-11 22:15:35,657 INFO L226 Difference]: Without dead ends: 18416 [2024-11-11 22:15:35,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:15:35,681 INFO L435 NwaCegarLoop]: 4546 mSDtfsCounter, 5568 mSDsluCounter, 17865 mSDsCounter, 0 mSdLazyCounter, 3545 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5587 SdHoareTripleChecker+Valid, 22411 SdHoareTripleChecker+Invalid, 3612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:15:35,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5587 Valid, 22411 Invalid, 3612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3545 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 22:15:35,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18416 states. [2024-11-11 22:15:36,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18416 to 14300. [2024-11-11 22:15:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14300 states, 13368 states have (on average 1.5970227408737283) internal successors, (21349), 13403 states have internal predecessors, (21349), 700 states have call successors, (700), 199 states have call predecessors, (700), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-11-11 22:15:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14300 states to 14300 states and 23022 transitions. [2024-11-11 22:15:36,266 INFO L78 Accepts]: Start accepts. Automaton has 14300 states and 23022 transitions. Word has length 179 [2024-11-11 22:15:36,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:15:36,267 INFO L471 AbstractCegarLoop]: Abstraction has 14300 states and 23022 transitions. [2024-11-11 22:15:36,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:15:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 14300 states and 23022 transitions. [2024-11-11 22:15:36,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:15:36,274 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:15:36,274 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] [2024-11-11 22:15:36,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:15:36,274 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:15:36,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:15:36,275 INFO L85 PathProgramCache]: Analyzing trace with hash -983791364, now seen corresponding path program 1 times [2024-11-11 22:15:36,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:15:36,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173504004] [2024-11-11 22:15:36,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:15:36,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:15:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:36,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:15:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:36,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:15:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:36,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:15:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:36,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:15:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:36,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:15:36,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:36,492 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:15:36,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:15:36,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173504004] [2024-11-11 22:15:36,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173504004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:15:36,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:15:36,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:15:36,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830889132] [2024-11-11 22:15:36,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:15:36,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:15:36,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:15:36,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:15:36,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:15:36,495 INFO L87 Difference]: Start difference. First operand 14300 states and 23022 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:15:38,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:15:38,630 INFO L93 Difference]: Finished difference Result 30826 states and 49644 transitions. [2024-11-11 22:15:38,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:15:38,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:15:38,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:15:38,691 INFO L225 Difference]: With dead ends: 30826 [2024-11-11 22:15:38,691 INFO L226 Difference]: Without dead ends: 18667 [2024-11-11 22:15:38,726 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:15:38,726 INFO L435 NwaCegarLoop]: 4275 mSDtfsCounter, 5121 mSDsluCounter, 16832 mSDsCounter, 0 mSdLazyCounter, 1813 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5141 SdHoareTripleChecker+Valid, 21107 SdHoareTripleChecker+Invalid, 1882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:15:38,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5141 Valid, 21107 Invalid, 1882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1813 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 22:15:38,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18667 states. [2024-11-11 22:15:39,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18667 to 14300. [2024-11-11 22:15:39,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14300 states, 13368 states have (on average 1.594554159186116) internal successors, (21316), 13403 states have internal predecessors, (21316), 700 states have call successors, (700), 199 states have call predecessors, (700), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-11-11 22:15:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14300 states to 14300 states and 22989 transitions. [2024-11-11 22:15:39,373 INFO L78 Accepts]: Start accepts. Automaton has 14300 states and 22989 transitions. Word has length 179 [2024-11-11 22:15:39,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:15:39,374 INFO L471 AbstractCegarLoop]: Abstraction has 14300 states and 22989 transitions. [2024-11-11 22:15:39,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:15:39,374 INFO L276 IsEmpty]: Start isEmpty. Operand 14300 states and 22989 transitions. [2024-11-11 22:15:39,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:15:39,382 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:15:39,382 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] [2024-11-11 22:15:39,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:15:39,383 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:15:39,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:15:39,383 INFO L85 PathProgramCache]: Analyzing trace with hash -597928962, now seen corresponding path program 1 times [2024-11-11 22:15:39,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:15:39,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900354306] [2024-11-11 22:15:39,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:15:39,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:15:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:39,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:15:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:39,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:15:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:39,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:15:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:39,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:15:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:39,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:15:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:39,591 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:15:39,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:15:39,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900354306] [2024-11-11 22:15:39,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900354306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:15:39,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:15:39,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:15:39,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481150723] [2024-11-11 22:15:39,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:15:39,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:15:39,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:15:39,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:15:39,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:15:39,592 INFO L87 Difference]: Start difference. First operand 14300 states and 22989 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:15:43,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:15:43,162 INFO L93 Difference]: Finished difference Result 46115 states and 73651 transitions. [2024-11-11 22:15:43,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:15:43,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:15:43,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:15:43,255 INFO L225 Difference]: With dead ends: 46115 [2024-11-11 22:15:43,256 INFO L226 Difference]: Without dead ends: 33956 [2024-11-11 22:15:43,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:15:43,290 INFO L435 NwaCegarLoop]: 4546 mSDtfsCounter, 5560 mSDsluCounter, 17865 mSDsCounter, 0 mSdLazyCounter, 3507 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5579 SdHoareTripleChecker+Valid, 22411 SdHoareTripleChecker+Invalid, 3574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:15:43,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5579 Valid, 22411 Invalid, 3574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3507 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 22:15:43,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33956 states. [2024-11-11 22:15:44,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33956 to 26150. [2024-11-11 22:15:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26150 states, 24322 states have (on average 1.5699366828385823) internal successors, (38184), 24389 states have internal predecessors, (38184), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-11-11 22:15:44,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26150 states to 26150 states and 41719 transitions. [2024-11-11 22:15:44,354 INFO L78 Accepts]: Start accepts. Automaton has 26150 states and 41719 transitions. Word has length 179 [2024-11-11 22:15:44,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:15:44,355 INFO L471 AbstractCegarLoop]: Abstraction has 26150 states and 41719 transitions. [2024-11-11 22:15:44,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:15:44,355 INFO L276 IsEmpty]: Start isEmpty. Operand 26150 states and 41719 transitions. [2024-11-11 22:15:44,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:15:44,368 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:15:44,368 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] [2024-11-11 22:15:44,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:15:44,369 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:15:44,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:15:44,369 INFO L85 PathProgramCache]: Analyzing trace with hash -862576452, now seen corresponding path program 1 times [2024-11-11 22:15:44,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:15:44,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615169758] [2024-11-11 22:15:44,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:15:44,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:15:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:44,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:15:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:44,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:15:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:44,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:15:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:44,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:15:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:44,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:15:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:44,601 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:15:44,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:15:44,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615169758] [2024-11-11 22:15:44,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615169758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:15:44,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:15:44,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:15:44,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888593161] [2024-11-11 22:15:44,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:15:44,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:15:44,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:15:44,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:15:44,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:15:44,603 INFO L87 Difference]: Start difference. First operand 26150 states and 41719 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:15:49,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:15:49,289 INFO L93 Difference]: Finished difference Result 89051 states and 142475 transitions. [2024-11-11 22:15:49,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:15:49,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:15:49,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:15:49,482 INFO L225 Difference]: With dead ends: 89051 [2024-11-11 22:15:49,482 INFO L226 Difference]: Without dead ends: 65042 [2024-11-11 22:15:49,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:15:49,543 INFO L435 NwaCegarLoop]: 4546 mSDtfsCounter, 5559 mSDsluCounter, 17865 mSDsCounter, 0 mSdLazyCounter, 3494 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5578 SdHoareTripleChecker+Valid, 22411 SdHoareTripleChecker+Invalid, 3561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:15:49,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5578 Valid, 22411 Invalid, 3561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3494 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 22:15:49,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65042 states. [2024-11-11 22:15:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65042 to 49911. [2024-11-11 22:15:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49911 states, 46291 states have (on average 1.555593959949018) internal successors, (72010), 46422 states have internal predecessors, (72010), 2716 states have call successors, (2716), 775 states have call predecessors, (2716), 902 states have return successors, (5029), 2841 states have call predecessors, (5029), 2714 states have call successors, (5029) [2024-11-11 22:15:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49911 states to 49911 states and 79755 transitions. [2024-11-11 22:15:51,864 INFO L78 Accepts]: Start accepts. Automaton has 49911 states and 79755 transitions. Word has length 179 [2024-11-11 22:15:51,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:15:51,864 INFO L471 AbstractCegarLoop]: Abstraction has 49911 states and 79755 transitions. [2024-11-11 22:15:51,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:15:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 49911 states and 79755 transitions. [2024-11-11 22:15:51,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:15:51,887 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:15:51,887 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] [2024-11-11 22:15:51,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:15:51,888 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:15:51,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:15:51,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1068549182, now seen corresponding path program 1 times [2024-11-11 22:15:51,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:15:51,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590343944] [2024-11-11 22:15:51,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:15:51,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:15:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:51,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:15:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:52,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:15:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:52,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:15:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:52,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:15:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:52,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:15:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:15:52,090 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:15:52,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:15:52,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590343944] [2024-11-11 22:15:52,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590343944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:15:52,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:15:52,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:15:52,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374851794] [2024-11-11 22:15:52,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:15:52,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:15:52,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:15:52,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:15:52,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:15:52,092 INFO L87 Difference]: Start difference. First operand 49911 states and 79755 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:15:59,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:15:59,491 INFO L93 Difference]: Finished difference Result 174922 states and 281969 transitions. [2024-11-11 22:15:59,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:15:59,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:15:59,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:16:00,107 INFO L225 Difference]: With dead ends: 174922 [2024-11-11 22:16:00,107 INFO L226 Difference]: Without dead ends: 127152 [2024-11-11 22:16:00,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:16:00,241 INFO L435 NwaCegarLoop]: 4300 mSDtfsCounter, 5662 mSDsluCounter, 17155 mSDsCounter, 0 mSdLazyCounter, 2982 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5681 SdHoareTripleChecker+Valid, 21455 SdHoareTripleChecker+Invalid, 3089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:16:00,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5681 Valid, 21455 Invalid, 3089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2982 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-11 22:16:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127152 states. [2024-11-11 22:16:05,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127152 to 97560. [2024-11-11 22:16:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97560 states, 90356 states have (on average 1.5477887467351366) internal successors, (139852), 90615 states have internal predecessors, (139852), 5404 states have call successors, (5404), 1543 states have call predecessors, (5404), 1798 states have return successors, (12219), 5657 states have call predecessors, (12219), 5402 states have call successors, (12219) [2024-11-11 22:16:05,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97560 states to 97560 states and 157475 transitions. [2024-11-11 22:16:05,594 INFO L78 Accepts]: Start accepts. Automaton has 97560 states and 157475 transitions. Word has length 179 [2024-11-11 22:16:05,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:16:05,594 INFO L471 AbstractCegarLoop]: Abstraction has 97560 states and 157475 transitions. [2024-11-11 22:16:05,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:16:05,594 INFO L276 IsEmpty]: Start isEmpty. Operand 97560 states and 157475 transitions. [2024-11-11 22:16:05,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-11 22:16:05,644 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:16:05,644 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] [2024-11-11 22:16:05,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:16:05,645 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:16:05,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:16:05,645 INFO L85 PathProgramCache]: Analyzing trace with hash -254629764, now seen corresponding path program 1 times [2024-11-11 22:16:05,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:16:05,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447739959] [2024-11-11 22:16:05,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:16:05,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:16:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:16:05,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:16:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:16:05,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 22:16:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:16:05,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 22:16:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:16:05,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 22:16:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:16:05,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-11 22:16:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:16:05,877 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:16:05,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:16:05,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447739959] [2024-11-11 22:16:05,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447739959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:16:05,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:16:05,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:16:05,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793867881] [2024-11-11 22:16:05,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:16:05,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:16:05,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:16:05,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:16:05,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:16:05,880 INFO L87 Difference]: Start difference. First operand 97560 states and 157475 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:16:12,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:16:12,733 INFO L93 Difference]: Finished difference Result 224442 states and 369619 transitions. [2024-11-11 22:16:12,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:16:12,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-11 22:16:12,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:16:13,344 INFO L225 Difference]: With dead ends: 224442 [2024-11-11 22:16:13,344 INFO L226 Difference]: Without dead ends: 129023