./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+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 38a1f42f3cb7a9f66fd0bd1b473ab60f2efbe0fc9c998d9f18da86c331297566 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:08:48,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:08:49,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:08:49,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:08:49,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:08:49,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:08:49,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:08:49,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:08:49,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:08:49,067 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:08:49,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:08:49,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:08:49,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:08:49,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:08:49,069 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:08:49,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:08:49,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:08:49,069 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:08:49,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:08:49,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:08:49,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:08:49,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:08:49,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:08:49,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:08:49,073 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:08:49,073 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:08:49,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:08:49,073 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:08:49,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:08:49,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:08:49,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:08:49,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:08:49,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:08:49,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:08:49,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:08:49,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:08:49,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:08:49,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:08:49,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:08:49,077 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:08:49,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:08:49,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:08:49,077 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 -> 38a1f42f3cb7a9f66fd0bd1b473ab60f2efbe0fc9c998d9f18da86c331297566 [2024-10-12 21:08:49,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:08:49,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:08:49,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:08:49,291 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:08:49,291 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:08:49,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c [2024-10-12 21:08:50,512 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:08:50,968 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:08:50,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c [2024-10-12 21:08:51,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/840a6f0d9/29449d65b82a4d8bba0ff2e97263222d/FLAG53cf21b37 [2024-10-12 21:08:51,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/840a6f0d9/29449d65b82a4d8bba0ff2e97263222d [2024-10-12 21:08:51,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:08:51,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:08:51,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:08:51,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:08:51,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:08:51,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:08:51" (1/1) ... [2024-10-12 21:08:51,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10637d07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:08:51, skipping insertion in model container [2024-10-12 21:08:51,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:08:51" (1/1) ... [2024-10-12 21:08:51,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:08:52,319 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c[380593,380606] [2024-10-12 21:08:52,340 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c[383339,383352] [2024-10-12 21:08:52,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:08:52,527 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:08:53,105 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c[380593,380606] [2024-10-12 21:08:53,110 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c[383339,383352] [2024-10-12 21:08:53,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:08:53,173 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:08:53,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:08:53 WrapperNode [2024-10-12 21:08:53,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:08:53,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:08:53,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:08:53,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:08:53,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:08:53" (1/1) ... [2024-10-12 21:08:53,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:08:53" (1/1) ... [2024-10-12 21:08:53,547 INFO L138 Inliner]: procedures = 68, calls = 78, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 13237 [2024-10-12 21:08:53,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:08:53,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:08:53,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:08:53,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:08:53,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:08:53" (1/1) ... [2024-10-12 21:08:53,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:08:53" (1/1) ... [2024-10-12 21:08:53,606 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:08:53" (1/1) ... [2024-10-12 21:08:53,683 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 21:08:53,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:08:53" (1/1) ... [2024-10-12 21:08:53,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:08:53" (1/1) ... [2024-10-12 21:08:53,808 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:08:53" (1/1) ... [2024-10-12 21:08:53,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:08:53" (1/1) ... [2024-10-12 21:08:53,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:08:53" (1/1) ... [2024-10-12 21:08:53,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:08:53" (1/1) ... [2024-10-12 21:08:53,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:08:53,944 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:08:53,944 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:08:53,944 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:08:53,946 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:08:53" (1/1) ... [2024-10-12 21:08:53,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:08:53,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:08:53,972 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-10-12 21:08:53,974 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-10-12 21:08:54,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:08:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 21:08:54,008 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 21:08:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:08:54,008 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:08:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 21:08:54,008 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 21:08:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-12 21:08:54,009 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-12 21:08:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 21:08:54,009 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 21:08:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 21:08:54,009 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 21:08:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 21:08:54,009 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 21:08:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:08:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:08:54,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:08:54,191 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:08:54,193 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:09:00,036 INFO L? ?]: Removed 1759 outVars from TransFormulas that were not future-live. [2024-10-12 21:09:00,037 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:09:00,138 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:09:00,138 INFO L314 CfgBuilder]: Removed 16 assume(true) statements. [2024-10-12 21:09:00,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:09:00 BoogieIcfgContainer [2024-10-12 21:09:00,139 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:09:00,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:09:00,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:09:00,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:09:00,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:08:51" (1/3) ... [2024-10-12 21:09:00,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c58ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:09:00, skipping insertion in model container [2024-10-12 21:09:00,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:08:53" (2/3) ... [2024-10-12 21:09:00,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c58ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:09:00, skipping insertion in model container [2024-10-12 21:09:00,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:09:00" (3/3) ... [2024-10-12 21:09:00,146 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.14.cil.c [2024-10-12 21:09:00,158 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:09:00,159 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:09:00,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:09:00,256 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;@8f20064, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:09:00,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:09:00,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 2477 states, 2439 states have (on average 1.8757687576875768) internal successors, (4575), 2444 states have internal predecessors, (4575), 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-10-12 21:09:00,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:09:00,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:09:00,281 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:09:00,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:09:00,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:09:00,285 INFO L85 PathProgramCache]: Analyzing trace with hash -567169950, now seen corresponding path program 1 times [2024-10-12 21:09:00,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:09:00,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808516871] [2024-10-12 21:09:00,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:09:00,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:09:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:00,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:09:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:00,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:09:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:00,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:09:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:00,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:09:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:00,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:09:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:09:00,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:09:00,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808516871] [2024-10-12 21:09:00,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808516871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:09:00,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:09:00,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:09:00,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807045900] [2024-10-12 21:09:00,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:09:00,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:09:00,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:09:00,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:09:00,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:09:00,860 INFO L87 Difference]: Start difference. First operand has 2477 states, 2439 states have (on average 1.8757687576875768) internal successors, (4575), 2444 states have internal predecessors, (4575), 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 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:02,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:09:02,435 INFO L93 Difference]: Finished difference Result 5079 states and 9486 transitions. [2024-10-12 21:09:02,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:09:02,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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 162 [2024-10-12 21:09:02,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:09:02,458 INFO L225 Difference]: With dead ends: 5079 [2024-10-12 21:09:02,458 INFO L226 Difference]: Without dead ends: 2602 [2024-10-12 21:09:02,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:09:02,468 INFO L432 NwaCegarLoop]: 4264 mSDtfsCounter, 989 mSDsluCounter, 12214 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 16478 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:09:02,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 16478 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:09:02,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2024-10-12 21:09:02,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2472. [2024-10-12 21:09:02,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 2436 states have (on average 1.8370279146141215) internal successors, (4475), 2439 states have internal predecessors, (4475), 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-10-12 21:09:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 4529 transitions. [2024-10-12 21:09:02,574 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 4529 transitions. Word has length 162 [2024-10-12 21:09:02,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:09:02,574 INFO L471 AbstractCegarLoop]: Abstraction has 2472 states and 4529 transitions. [2024-10-12 21:09:02,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 4529 transitions. [2024-10-12 21:09:02,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:09:02,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:09:02,578 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:09:02,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:09:02,578 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:09:02,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:09:02,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1202301664, now seen corresponding path program 1 times [2024-10-12 21:09:02,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:09:02,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886836430] [2024-10-12 21:09:02,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:09:02,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:09:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:02,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:09:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:02,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:09:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:02,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:09:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:02,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:09:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:02,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:09:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:09:02,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:09:02,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886836430] [2024-10-12 21:09:02,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886836430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:09:02,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:09:02,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:09:02,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579523796] [2024-10-12 21:09:02,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:09:02,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:09:02,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:09:02,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:09:02,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:09:02,792 INFO L87 Difference]: Start difference. First operand 2472 states and 4529 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:04,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:09:04,202 INFO L93 Difference]: Finished difference Result 2940 states and 5310 transitions. [2024-10-12 21:09:04,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:09:04,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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 162 [2024-10-12 21:09:04,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:09:04,211 INFO L225 Difference]: With dead ends: 2940 [2024-10-12 21:09:04,211 INFO L226 Difference]: Without dead ends: 2602 [2024-10-12 21:09:04,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:09:04,213 INFO L432 NwaCegarLoop]: 4260 mSDtfsCounter, 977 mSDsluCounter, 12205 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 16465 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:09:04,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 16465 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:09:04,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2024-10-12 21:09:04,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2472. [2024-10-12 21:09:04,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 2436 states have (on average 1.8366174055829227) internal successors, (4474), 2439 states have internal predecessors, (4474), 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-10-12 21:09:04,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 4528 transitions. [2024-10-12 21:09:04,264 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 4528 transitions. Word has length 162 [2024-10-12 21:09:04,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:09:04,268 INFO L471 AbstractCegarLoop]: Abstraction has 2472 states and 4528 transitions. [2024-10-12 21:09:04,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:04,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 4528 transitions. [2024-10-12 21:09:04,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:09:04,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:09:04,274 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:09:04,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:09:04,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:09:04,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:09:04,275 INFO L85 PathProgramCache]: Analyzing trace with hash -728823970, now seen corresponding path program 1 times [2024-10-12 21:09:04,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:09:04,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9276272] [2024-10-12 21:09:04,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:09:04,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:09:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:04,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:09:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:04,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:09:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:04,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:09:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:04,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:09:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:04,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:09:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:09:04,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:09:04,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9276272] [2024-10-12 21:09:04,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9276272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:09:04,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:09:04,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:09:04,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593092185] [2024-10-12 21:09:04,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:09:04,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:09:04,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:09:04,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:09:04,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:09:04,519 INFO L87 Difference]: Start difference. First operand 2472 states and 4528 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:06,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:09:06,837 INFO L93 Difference]: Finished difference Result 3417 states and 6110 transitions. [2024-10-12 21:09:06,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:09:06,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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 162 [2024-10-12 21:09:06,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:09:06,848 INFO L225 Difference]: With dead ends: 3417 [2024-10-12 21:09:06,849 INFO L226 Difference]: Without dead ends: 3084 [2024-10-12 21:09:06,852 INFO L431 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-10-12 21:09:06,853 INFO L432 NwaCegarLoop]: 4228 mSDtfsCounter, 5445 mSDsluCounter, 12677 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5464 SdHoareTripleChecker+Valid, 16905 SdHoareTripleChecker+Invalid, 2418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:09:06,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5464 Valid, 16905 Invalid, 2418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 21:09:06,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2024-10-12 21:09:06,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 2823. [2024-10-12 21:09:06,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2823 states, 2759 states have (on average 1.8151504168176875) internal successors, (5008), 2763 states have internal predecessors, (5008), 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-10-12 21:09:06,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 5107 transitions. [2024-10-12 21:09:06,925 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 5107 transitions. Word has length 162 [2024-10-12 21:09:06,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:09:06,925 INFO L471 AbstractCegarLoop]: Abstraction has 2823 states and 5107 transitions. [2024-10-12 21:09:06,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:06,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 5107 transitions. [2024-10-12 21:09:06,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:09:06,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:09:06,927 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:09:06,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:09:06,928 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:09:06,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:09:06,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1360774942, now seen corresponding path program 1 times [2024-10-12 21:09:06,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:09:06,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029383592] [2024-10-12 21:09:06,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:09:06,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:09:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:07,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:09:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:07,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:09:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:07,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:09:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:07,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:09:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:07,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:09:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:09:07,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:09:07,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029383592] [2024-10-12 21:09:07,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029383592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:09:07,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:09:07,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:09:07,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614341557] [2024-10-12 21:09:07,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:09:07,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:09:07,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:09:07,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:09:07,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:09:07,183 INFO L87 Difference]: Start difference. First operand 2823 states and 5107 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:10,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:09:10,135 INFO L93 Difference]: Finished difference Result 4268 states and 7528 transitions. [2024-10-12 21:09:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:09:10,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:09:10,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:09:10,148 INFO L225 Difference]: With dead ends: 4268 [2024-10-12 21:09:10,149 INFO L226 Difference]: Without dead ends: 3584 [2024-10-12 21:09:10,153 INFO L431 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-10-12 21:09:10,154 INFO L432 NwaCegarLoop]: 4433 mSDtfsCounter, 5480 mSDsluCounter, 17405 mSDsCounter, 0 mSdLazyCounter, 3740 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5499 SdHoareTripleChecker+Valid, 21838 SdHoareTripleChecker+Invalid, 3805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:09:10,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5499 Valid, 21838 Invalid, 3805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3740 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 21:09:10,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2024-10-12 21:09:10,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 3147. [2024-10-12 21:09:10,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3147 states, 3055 states have (on average 1.7963993453355156) internal successors, (5488), 3060 states have internal predecessors, (5488), 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-10-12 21:09:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3147 states to 3147 states and 5631 transitions. [2024-10-12 21:09:10,238 INFO L78 Accepts]: Start accepts. Automaton has 3147 states and 5631 transitions. Word has length 162 [2024-10-12 21:09:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:09:10,239 INFO L471 AbstractCegarLoop]: Abstraction has 3147 states and 5631 transitions. [2024-10-12 21:09:10,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3147 states and 5631 transitions. [2024-10-12 21:09:10,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:09:10,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:09:10,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:09:10,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:09:10,242 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:09:10,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:09:10,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1771385308, now seen corresponding path program 1 times [2024-10-12 21:09:10,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:09:10,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197529501] [2024-10-12 21:09:10,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:09:10,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:09:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:10,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:09:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:10,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:09:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:10,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:09:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:10,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:09:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:10,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:09:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:10,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:09:10,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:09:10,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197529501] [2024-10-12 21:09:10,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197529501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:09:10,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:09:10,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:09:10,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370695229] [2024-10-12 21:09:10,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:09:10,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:09:10,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:09:10,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:09:10,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:09:10,574 INFO L87 Difference]: Start difference. First operand 3147 states and 5631 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:13,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:09:13,498 INFO L93 Difference]: Finished difference Result 5515 states and 9592 transitions. [2024-10-12 21:09:13,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:09:13,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:09:13,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:09:13,512 INFO L225 Difference]: With dead ends: 5515 [2024-10-12 21:09:13,512 INFO L226 Difference]: Without dead ends: 4507 [2024-10-12 21:09:13,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:09:13,516 INFO L432 NwaCegarLoop]: 4237 mSDtfsCounter, 5592 mSDsluCounter, 16878 mSDsCounter, 0 mSdLazyCounter, 3099 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5611 SdHoareTripleChecker+Valid, 21115 SdHoareTripleChecker+Invalid, 3206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:09:13,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5611 Valid, 21115 Invalid, 3206 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [107 Valid, 3099 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 21:09:13,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2024-10-12 21:09:13,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 3796. [2024-10-12 21:09:13,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3796 states, 3648 states have (on average 1.7678179824561404) internal successors, (6449), 3655 states have internal predecessors, (6449), 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-10-12 21:09:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 6684 transitions. [2024-10-12 21:09:13,636 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 6684 transitions. Word has length 162 [2024-10-12 21:09:13,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:09:13,637 INFO L471 AbstractCegarLoop]: Abstraction has 3796 states and 6684 transitions. [2024-10-12 21:09:13,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:13,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 6684 transitions. [2024-10-12 21:09:13,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:09:13,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:09:13,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:09:13,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:09:13,639 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:09:13,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:09:13,639 INFO L85 PathProgramCache]: Analyzing trace with hash -16484514, now seen corresponding path program 1 times [2024-10-12 21:09:13,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:09:13,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248077780] [2024-10-12 21:09:13,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:09:13,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:09:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:13,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:09:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:13,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:09:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:13,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:09:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:13,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:09:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:13,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:09:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:09:13,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:09:13,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248077780] [2024-10-12 21:09:13,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248077780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:09:13,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:09:13,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:09:13,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864825356] [2024-10-12 21:09:13,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:09:13,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:09:13,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:09:13,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:09:13,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:09:13,849 INFO L87 Difference]: Start difference. First operand 3796 states and 6684 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:15,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:09:15,374 INFO L93 Difference]: Finished difference Result 6152 states and 10636 transitions. [2024-10-12 21:09:15,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:09:15,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:09:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:09:15,387 INFO L225 Difference]: With dead ends: 6152 [2024-10-12 21:09:15,388 INFO L226 Difference]: Without dead ends: 4495 [2024-10-12 21:09:15,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:09:15,393 INFO L432 NwaCegarLoop]: 4215 mSDtfsCounter, 5203 mSDsluCounter, 12497 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5223 SdHoareTripleChecker+Valid, 16712 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:09:15,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5223 Valid, 16712 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:09:15,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2024-10-12 21:09:15,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 3796. [2024-10-12 21:09:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3796 states, 3648 states have (on average 1.7664473684210527) internal successors, (6444), 3655 states have internal predecessors, (6444), 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-10-12 21:09:15,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 6679 transitions. [2024-10-12 21:09:15,499 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 6679 transitions. Word has length 162 [2024-10-12 21:09:15,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:09:15,499 INFO L471 AbstractCegarLoop]: Abstraction has 3796 states and 6679 transitions. [2024-10-12 21:09:15,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:15,500 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 6679 transitions. [2024-10-12 21:09:15,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:09:15,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:09:15,501 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:09:15,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:09:15,502 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:09:15,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:09:15,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2142599580, now seen corresponding path program 1 times [2024-10-12 21:09:15,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:09:15,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854707483] [2024-10-12 21:09:15,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:09:15,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:09:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:15,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:09:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:15,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:09:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:15,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:09:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:15,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:09:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:15,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:09:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:15,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:09:15,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:09:15,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854707483] [2024-10-12 21:09:15,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854707483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:09:15,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:09:15,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:09:15,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396207822] [2024-10-12 21:09:15,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:09:15,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:09:15,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:09:15,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:09:15,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:09:15,717 INFO L87 Difference]: Start difference. First operand 3796 states and 6679 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:09:17,204 INFO L93 Difference]: Finished difference Result 6141 states and 10600 transitions. [2024-10-12 21:09:17,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:09:17,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:09:17,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:09:17,228 INFO L225 Difference]: With dead ends: 6141 [2024-10-12 21:09:17,228 INFO L226 Difference]: Without dead ends: 4484 [2024-10-12 21:09:17,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:09:17,238 INFO L432 NwaCegarLoop]: 4215 mSDtfsCounter, 5046 mSDsluCounter, 16621 mSDsCounter, 0 mSdLazyCounter, 1884 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5066 SdHoareTripleChecker+Valid, 20836 SdHoareTripleChecker+Invalid, 1953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:09:17,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5066 Valid, 20836 Invalid, 1953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1884 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:09:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4484 states. [2024-10-12 21:09:17,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4484 to 3796. [2024-10-12 21:09:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3796 states, 3648 states have (on average 1.765076754385965) internal successors, (6439), 3655 states have internal predecessors, (6439), 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-10-12 21:09:17,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 6674 transitions. [2024-10-12 21:09:17,374 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 6674 transitions. Word has length 162 [2024-10-12 21:09:17,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:09:17,375 INFO L471 AbstractCegarLoop]: Abstraction has 3796 states and 6674 transitions. [2024-10-12 21:09:17,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:17,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 6674 transitions. [2024-10-12 21:09:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:09:17,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:09:17,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:09:17,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:09:17,377 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:09:17,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:09:17,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1734479014, now seen corresponding path program 1 times [2024-10-12 21:09:17,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:09:17,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910834212] [2024-10-12 21:09:17,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:09:17,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:09:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:17,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:09:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:17,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:09:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:17,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:09:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:17,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:09:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:17,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:09:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:09:17,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:09:17,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910834212] [2024-10-12 21:09:17,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910834212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:09:17,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:09:17,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:09:17,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991651591] [2024-10-12 21:09:17,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:09:17,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:09:17,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:09:17,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:09:17,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:09:17,575 INFO L87 Difference]: Start difference. First operand 3796 states and 6674 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:09:20,464 INFO L93 Difference]: Finished difference Result 7887 states and 13447 transitions. [2024-10-12 21:09:20,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:09:20,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:09:20,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:09:20,478 INFO L225 Difference]: With dead ends: 7887 [2024-10-12 21:09:20,478 INFO L226 Difference]: Without dead ends: 6230 [2024-10-12 21:09:20,483 INFO L431 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-10-12 21:09:20,484 INFO L432 NwaCegarLoop]: 4431 mSDtfsCounter, 5463 mSDsluCounter, 17405 mSDsCounter, 0 mSdLazyCounter, 3661 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5482 SdHoareTripleChecker+Valid, 21836 SdHoareTripleChecker+Invalid, 3728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:09:20,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5482 Valid, 21836 Invalid, 3728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3661 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 21:09:20,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6230 states. [2024-10-12 21:09:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6230 to 5109. [2024-10-12 21:09:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5109 states, 4849 states have (on average 1.7269540111363169) internal successors, (8374), 4860 states have internal predecessors, (8374), 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-10-12 21:09:20,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5109 states to 5109 states and 8799 transitions. [2024-10-12 21:09:20,644 INFO L78 Accepts]: Start accepts. Automaton has 5109 states and 8799 transitions. Word has length 162 [2024-10-12 21:09:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:09:20,644 INFO L471 AbstractCegarLoop]: Abstraction has 5109 states and 8799 transitions. [2024-10-12 21:09:20,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 5109 states and 8799 transitions. [2024-10-12 21:09:20,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:09:20,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:09:20,647 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:09:20,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:09:20,647 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:09:20,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:09:20,648 INFO L85 PathProgramCache]: Analyzing trace with hash -335525412, now seen corresponding path program 1 times [2024-10-12 21:09:20,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:09:20,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24208887] [2024-10-12 21:09:20,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:09:20,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:09:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:20,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:09:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:20,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:09:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:20,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:09:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:20,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:09:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:20,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:09:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:20,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:09:20,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:09:20,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24208887] [2024-10-12 21:09:20,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24208887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:09:20,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:09:20,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:09:20,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709317730] [2024-10-12 21:09:20,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:09:20,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:09:20,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:09:20,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:09:20,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:09:20,842 INFO L87 Difference]: Start difference. First operand 5109 states and 8799 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:22,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:09:22,444 INFO L93 Difference]: Finished difference Result 9223 states and 15645 transitions. [2024-10-12 21:09:22,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:09:22,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:09:22,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:09:22,457 INFO L225 Difference]: With dead ends: 9223 [2024-10-12 21:09:22,457 INFO L226 Difference]: Without dead ends: 6253 [2024-10-12 21:09:22,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:09:22,465 INFO L432 NwaCegarLoop]: 4215 mSDtfsCounter, 5045 mSDsluCounter, 16621 mSDsCounter, 0 mSdLazyCounter, 1858 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5065 SdHoareTripleChecker+Valid, 20836 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:09:22,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5065 Valid, 20836 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1858 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:09:22,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6253 states. [2024-10-12 21:09:22,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6253 to 5109. [2024-10-12 21:09:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5109 states, 4849 states have (on average 1.7250979583419261) internal successors, (8365), 4860 states have internal predecessors, (8365), 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-10-12 21:09:22,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5109 states to 5109 states and 8790 transitions. [2024-10-12 21:09:22,613 INFO L78 Accepts]: Start accepts. Automaton has 5109 states and 8790 transitions. Word has length 162 [2024-10-12 21:09:22,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:09:22,614 INFO L471 AbstractCegarLoop]: Abstraction has 5109 states and 8790 transitions. [2024-10-12 21:09:22,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:22,614 INFO L276 IsEmpty]: Start isEmpty. Operand 5109 states and 8790 transitions. [2024-10-12 21:09:22,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:09:22,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:09:22,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:09:22,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:09:22,616 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:09:22,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:09:22,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1952965862, now seen corresponding path program 1 times [2024-10-12 21:09:22,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:09:22,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936821903] [2024-10-12 21:09:22,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:09:22,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:09:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:22,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:09:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:22,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:09:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:22,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:09:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:22,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:09:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:22,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:09:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:09:22,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:09:22,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936821903] [2024-10-12 21:09:22,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936821903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:09:22,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:09:22,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:09:22,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497528980] [2024-10-12 21:09:22,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:09:22,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:09:22,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:09:22,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:09:22,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:09:22,805 INFO L87 Difference]: Start difference. First operand 5109 states and 8790 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:26,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:09:26,039 INFO L93 Difference]: Finished difference Result 12658 states and 21228 transitions. [2024-10-12 21:09:26,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:09:26,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:09:26,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:09:26,062 INFO L225 Difference]: With dead ends: 12658 [2024-10-12 21:09:26,062 INFO L226 Difference]: Without dead ends: 9688 [2024-10-12 21:09:26,071 INFO L431 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-10-12 21:09:26,072 INFO L432 NwaCegarLoop]: 4431 mSDtfsCounter, 5455 mSDsluCounter, 17405 mSDsCounter, 0 mSdLazyCounter, 3623 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5474 SdHoareTripleChecker+Valid, 21836 SdHoareTripleChecker+Invalid, 3690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:09:26,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5474 Valid, 21836 Invalid, 3690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3623 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 21:09:26,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9688 states. [2024-10-12 21:09:26,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9688 to 7745. [2024-10-12 21:09:26,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7745 states, 7261 states have (on average 1.6850296102465225) internal successors, (12235), 7280 states have internal predecessors, (12235), 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-10-12 21:09:26,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7745 states to 7745 states and 13058 transitions. [2024-10-12 21:09:26,363 INFO L78 Accepts]: Start accepts. Automaton has 7745 states and 13058 transitions. Word has length 162 [2024-10-12 21:09:26,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:09:26,364 INFO L471 AbstractCegarLoop]: Abstraction has 7745 states and 13058 transitions. [2024-10-12 21:09:26,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:26,364 INFO L276 IsEmpty]: Start isEmpty. Operand 7745 states and 13058 transitions. [2024-10-12 21:09:26,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:09:26,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:09:26,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:09:26,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:09:26,367 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:09:26,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:09:26,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1589499364, now seen corresponding path program 1 times [2024-10-12 21:09:26,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:09:26,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463398638] [2024-10-12 21:09:26,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:09:26,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:09:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:26,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:09:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:26,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:09:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:26,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:09:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:26,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:09:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:26,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:09:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:09:26,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:09:26,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463398638] [2024-10-12 21:09:26,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463398638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:09:26,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:09:26,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:09:26,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962261955] [2024-10-12 21:09:26,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:09:26,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:09:26,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:09:26,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:09:26,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:09:26,556 INFO L87 Difference]: Start difference. First operand 7745 states and 13058 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:29,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:09:29,715 INFO L93 Difference]: Finished difference Result 22216 states and 36922 transitions. [2024-10-12 21:09:29,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:09:29,716 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:09:29,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:09:29,757 INFO L225 Difference]: With dead ends: 22216 [2024-10-12 21:09:29,758 INFO L226 Difference]: Without dead ends: 16610 [2024-10-12 21:09:29,776 INFO L431 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-10-12 21:09:29,777 INFO L432 NwaCegarLoop]: 4431 mSDtfsCounter, 5454 mSDsluCounter, 17405 mSDsCounter, 0 mSdLazyCounter, 3610 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5473 SdHoareTripleChecker+Valid, 21836 SdHoareTripleChecker+Invalid, 3677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:09:29,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5473 Valid, 21836 Invalid, 3677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3610 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 21:09:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16610 states. [2024-10-12 21:09:30,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16610 to 13030. [2024-10-12 21:09:30,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13030 states, 12098 states have (on average 1.652587204496611) internal successors, (19993), 12133 states have internal predecessors, (19993), 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-10-12 21:09:30,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13030 states to 13030 states and 21666 transitions. [2024-10-12 21:09:30,407 INFO L78 Accepts]: Start accepts. Automaton has 13030 states and 21666 transitions. Word has length 162 [2024-10-12 21:09:30,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:09:30,407 INFO L471 AbstractCegarLoop]: Abstraction has 13030 states and 21666 transitions. [2024-10-12 21:09:30,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 13030 states and 21666 transitions. [2024-10-12 21:09:30,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:09:30,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:09:30,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:09:30,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:09:30,414 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:09:30,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:09:30,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1300679974, now seen corresponding path program 1 times [2024-10-12 21:09:30,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:09:30,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72449842] [2024-10-12 21:09:30,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:09:30,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:09:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:30,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:09:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:30,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:09:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:30,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:09:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:30,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:09:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:30,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:09:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:09:30,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:09:30,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72449842] [2024-10-12 21:09:30,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72449842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:09:30,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:09:30,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:09:30,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476766193] [2024-10-12 21:09:30,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:09:30,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:09:30,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:09:30,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:09:30,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:09:30,595 INFO L87 Difference]: Start difference. First operand 13030 states and 21666 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:34,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:09:34,224 INFO L93 Difference]: Finished difference Result 41331 states and 68500 transitions. [2024-10-12 21:09:34,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:09:34,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:09:34,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:09:34,302 INFO L225 Difference]: With dead ends: 41331 [2024-10-12 21:09:34,303 INFO L226 Difference]: Without dead ends: 30440 [2024-10-12 21:09:34,335 INFO L431 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-10-12 21:09:34,335 INFO L432 NwaCegarLoop]: 4237 mSDtfsCounter, 5553 mSDsluCounter, 16878 mSDsCounter, 0 mSdLazyCounter, 3005 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5572 SdHoareTripleChecker+Valid, 21115 SdHoareTripleChecker+Invalid, 3112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:09:34,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5572 Valid, 21115 Invalid, 3112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 3005 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 21:09:34,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30440 states. [2024-10-12 21:09:35,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30440 to 23631. [2024-10-12 21:09:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23631 states, 21803 states have (on average 1.6307388891436958) internal successors, (35555), 21870 states have internal predecessors, (35555), 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-10-12 21:09:35,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23631 states to 23631 states and 39090 transitions. [2024-10-12 21:09:35,529 INFO L78 Accepts]: Start accepts. Automaton has 23631 states and 39090 transitions. Word has length 162 [2024-10-12 21:09:35,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:09:35,529 INFO L471 AbstractCegarLoop]: Abstraction has 23631 states and 39090 transitions. [2024-10-12 21:09:35,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:35,530 INFO L276 IsEmpty]: Start isEmpty. Operand 23631 states and 39090 transitions. [2024-10-12 21:09:35,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:09:35,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:09:35,540 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:09:35,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:09:35,540 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:09:35,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:09:35,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1845552548, now seen corresponding path program 1 times [2024-10-12 21:09:35,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:09:35,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720256813] [2024-10-12 21:09:35,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:09:35,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:09:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:35,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:09:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:35,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:09:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:35,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:09:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:35,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:09:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:35,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:09:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:09:35,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:09:35,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720256813] [2024-10-12 21:09:35,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720256813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:09:35,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:09:35,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:09:35,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892557990] [2024-10-12 21:09:35,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:09:35,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:09:35,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:09:35,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:09:35,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:09:35,824 INFO L87 Difference]: Start difference. First operand 23631 states and 39090 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:09:38,217 INFO L93 Difference]: Finished difference Result 52363 states and 87432 transitions. [2024-10-12 21:09:38,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:09:38,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:09:38,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:09:38,299 INFO L225 Difference]: With dead ends: 52363 [2024-10-12 21:09:38,299 INFO L226 Difference]: Without dead ends: 30871 [2024-10-12 21:09:38,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:09:38,342 INFO L432 NwaCegarLoop]: 4215 mSDtfsCounter, 5205 mSDsluCounter, 12497 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5225 SdHoareTripleChecker+Valid, 16712 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 21:09:38,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5225 Valid, 16712 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1636 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 21:09:38,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30871 states. [2024-10-12 21:09:39,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30871 to 23631. [2024-10-12 21:09:39,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23631 states, 21803 states have (on average 1.6277576480300877) internal successors, (35490), 21870 states have internal predecessors, (35490), 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-10-12 21:09:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23631 states to 23631 states and 39025 transitions. [2024-10-12 21:09:39,526 INFO L78 Accepts]: Start accepts. Automaton has 23631 states and 39025 transitions. Word has length 162 [2024-10-12 21:09:39,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:09:39,527 INFO L471 AbstractCegarLoop]: Abstraction has 23631 states and 39025 transitions. [2024-10-12 21:09:39,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:39,527 INFO L276 IsEmpty]: Start isEmpty. Operand 23631 states and 39025 transitions. [2024-10-12 21:09:39,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:09:39,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:09:39,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:09:39,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:09:39,537 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:09:39,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:09:39,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1170392422, now seen corresponding path program 1 times [2024-10-12 21:09:39,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:09:39,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527353218] [2024-10-12 21:09:39,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:09:39,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:09:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:39,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:09:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:39,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:09:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:39,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:09:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:39,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:09:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:39,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:09:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:09:39,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:09:39,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527353218] [2024-10-12 21:09:39,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527353218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:09:39,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:09:39,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:09:39,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892908553] [2024-10-12 21:09:39,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:09:39,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:09:39,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:09:39,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:09:39,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:09:39,710 INFO L87 Difference]: Start difference. First operand 23631 states and 39025 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:45,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:09:45,411 INFO L93 Difference]: Finished difference Result 89158 states and 147480 transitions. [2024-10-12 21:09:45,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:09:45,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:09:45,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:09:45,580 INFO L225 Difference]: With dead ends: 89158 [2024-10-12 21:09:45,580 INFO L226 Difference]: Without dead ends: 67666 [2024-10-12 21:09:45,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:09:45,632 INFO L432 NwaCegarLoop]: 4429 mSDtfsCounter, 5881 mSDsluCounter, 17400 mSDsCounter, 0 mSdLazyCounter, 3530 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5913 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 3600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 3530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:09:45,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5913 Valid, 21829 Invalid, 3600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 3530 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 21:09:45,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67666 states. [2024-10-12 21:09:47,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67666 to 44898. [2024-10-12 21:09:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44898 states, 41342 states have (on average 1.6152097140922064) internal successors, (66776), 41473 states have internal predecessors, (66776), 2652 states have call successors, (2652), 775 states have call predecessors, (2652), 902 states have return successors, (4965), 2777 states have call predecessors, (4965), 2650 states have call successors, (4965) [2024-10-12 21:09:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44898 states to 44898 states and 74393 transitions. [2024-10-12 21:09:48,136 INFO L78 Accepts]: Start accepts. Automaton has 44898 states and 74393 transitions. Word has length 162 [2024-10-12 21:09:48,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:09:48,136 INFO L471 AbstractCegarLoop]: Abstraction has 44898 states and 74393 transitions. [2024-10-12 21:09:48,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:48,137 INFO L276 IsEmpty]: Start isEmpty. Operand 44898 states and 74393 transitions. [2024-10-12 21:09:48,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:09:48,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:09:48,156 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:09:48,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:09:48,156 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:09:48,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:09:48,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1755164072, now seen corresponding path program 1 times [2024-10-12 21:09:48,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:09:48,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207318885] [2024-10-12 21:09:48,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:09:48,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:09:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:48,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:09:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:48,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:09:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:48,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:09:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:48,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:09:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:48,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:09:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:09:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:09:48,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:09:48,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207318885] [2024-10-12 21:09:48,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207318885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:09:48,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:09:48,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:09:48,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981407150] [2024-10-12 21:09:48,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:09:48,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:09:48,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:09:48,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:09:48,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:09:48,338 INFO L87 Difference]: Start difference. First operand 44898 states and 74393 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:09:58,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:09:58,000 INFO L93 Difference]: Finished difference Result 173559 states and 289394 transitions. [2024-10-12 21:09:58,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:09:58,000 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-12 21:09:58,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:09:58,485 INFO L225 Difference]: With dead ends: 173559 [2024-10-12 21:09:58,485 INFO L226 Difference]: Without dead ends: 130800 [2024-10-12 21:09:58,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:09:58,569 INFO L432 NwaCegarLoop]: 4428 mSDtfsCounter, 5546 mSDsluCounter, 17397 mSDsCounter, 0 mSdLazyCounter, 4193 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5564 SdHoareTripleChecker+Valid, 21825 SdHoareTripleChecker+Invalid, 4262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 4193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:09:58,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5564 Valid, 21825 Invalid, 4262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 4193 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 21:09:58,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130800 states. [2024-10-12 21:10:03,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130800 to 86403. [2024-10-12 21:10:03,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86403 states, 79455 states have (on average 1.6068718142344725) internal successors, (127674), 79714 states have internal predecessors, (127674), 5148 states have call successors, (5148), 1543 states have call predecessors, (5148), 1798 states have return successors, (11963), 5401 states have call predecessors, (11963), 5146 states have call successors, (11963) [2024-10-12 21:10:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86403 states to 86403 states and 144785 transitions. [2024-10-12 21:10:04,254 INFO L78 Accepts]: Start accepts. Automaton has 86403 states and 144785 transitions. Word has length 162 [2024-10-12 21:10:04,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:10:04,254 INFO L471 AbstractCegarLoop]: Abstraction has 86403 states and 144785 transitions. [2024-10-12 21:10:04,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:10:04,255 INFO L276 IsEmpty]: Start isEmpty. Operand 86403 states and 144785 transitions. [2024-10-12 21:10:04,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-12 21:10:04,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:10:04,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:10:04,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:10:04,300 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:10:04,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:10:04,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2105297626, now seen corresponding path program 1 times [2024-10-12 21:10:04,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:10:04,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737898744] [2024-10-12 21:10:04,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:10:04,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:10:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:10:04,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:10:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:10:04,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:10:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:10:04,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 21:10:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:10:04,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 21:10:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:10:04,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-12 21:10:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:10:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:10:04,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:10:04,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737898744] [2024-10-12 21:10:04,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737898744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:10:04,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:10:04,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:10:04,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616510213] [2024-10-12 21:10:04,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:10:04,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:10:04,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:10:04,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:10:04,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:10:04,480 INFO L87 Difference]: Start difference. First operand 86403 states and 144785 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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)