./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_label45+token_ring.15.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_label45+token_ring.15.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 9f6b3df944a21b7c8707e83029bbb1a58d3af14f3c6a747de4c932a385afddd0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:01:52,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:01:52,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:01:52,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:01:52,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:01:52,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:01:52,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:01:52,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:01:52,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:01:52,970 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:01:52,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:01:52,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:01:52,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:01:52,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:01:52,972 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:01:52,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:01:52,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:01:52,973 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:01:52,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:01:52,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:01:52,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:01:52,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:01:52,975 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:01:52,975 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:01:52,976 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:01:52,976 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:01:52,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:01:52,977 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:01:52,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:01:52,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:01:52,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:01:52,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:01:52,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:01:52,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:01:52,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:01:52,979 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:01:52,979 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:01:52,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:01:52,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:01:52,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:01:52,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:01:52,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:01:52,981 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 -> 9f6b3df944a21b7c8707e83029bbb1a58d3af14f3c6a747de4c932a385afddd0 [2024-10-12 21:01:53,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:01:53,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:01:53,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:01:53,260 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:01:53,260 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:01:53,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.15.cil.c [2024-10-12 21:01:54,681 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:01:55,339 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:01:55,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.15.cil.c [2024-10-12 21:01:55,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62e608411/6a6f4d078f274dd4b8a2048ba140f338/FLAG39aea9433 [2024-10-12 21:01:55,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62e608411/6a6f4d078f274dd4b8a2048ba140f338 [2024-10-12 21:01:55,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:01:55,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:01:55,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:01:55,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:01:55,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:01:55,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:01:55" (1/1) ... [2024-10-12 21:01:55,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b5d0bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:55, skipping insertion in model container [2024-10-12 21:01:55,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:01:55" (1/1) ... [2024-10-12 21:01:55,610 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:01:57,135 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_label45+token_ring.15.cil.c[380323,380336] [2024-10-12 21:01:57,171 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_label45+token_ring.15.cil.c[383339,383352] [2024-10-12 21:01:57,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:01:57,495 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:01:58,243 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_label45+token_ring.15.cil.c[380323,380336] [2024-10-12 21:01:58,249 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_label45+token_ring.15.cil.c[383339,383352] [2024-10-12 21:01:58,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:01:58,343 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:01:58,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:58 WrapperNode [2024-10-12 21:01:58,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:01:58,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:01:58,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:01:58,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:01:58,352 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:01:58" (1/1) ... [2024-10-12 21:01:58,442 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:01:58" (1/1) ... [2024-10-12 21:01:58,789 INFO L138 Inliner]: procedures = 70, calls = 81, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 13297 [2024-10-12 21:01:58,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:01:58,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:01:58,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:01:58,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:01:58,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:58" (1/1) ... [2024-10-12 21:01:58,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:58" (1/1) ... [2024-10-12 21:01:58,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:58" (1/1) ... [2024-10-12 21:01:58,957 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:01:58,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:58" (1/1) ... [2024-10-12 21:01:58,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:58" (1/1) ... [2024-10-12 21:01:59,231 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:58" (1/1) ... [2024-10-12 21:01:59,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:58" (1/1) ... [2024-10-12 21:01:59,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:58" (1/1) ... [2024-10-12 21:01:59,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:58" (1/1) ... [2024-10-12 21:01:59,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:01:59,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:01:59,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:01:59,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:01:59,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:58" (1/1) ... [2024-10-12 21:01:59,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:01:59,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:01:59,559 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:01:59,581 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:01:59,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:01:59,667 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 21:01:59,668 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 21:01:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:01:59,668 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:01:59,668 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 21:01:59,670 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 21:01:59,670 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-12 21:01:59,671 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-12 21:01:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 21:01:59,671 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 21:01:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 21:01:59,671 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 21:01:59,671 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 21:01:59,671 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 21:01:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:01:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:01:59,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:01:59,930 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:01:59,936 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:02:07,325 INFO L? ?]: Removed 1765 outVars from TransFormulas that were not future-live. [2024-10-12 21:02:07,325 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:02:07,457 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:02:07,458 INFO L314 CfgBuilder]: Removed 17 assume(true) statements. [2024-10-12 21:02:07,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:02:07 BoogieIcfgContainer [2024-10-12 21:02:07,458 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:02:07,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:02:07,462 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:02:07,465 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:02:07,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:01:55" (1/3) ... [2024-10-12 21:02:07,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6420faa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:02:07, skipping insertion in model container [2024-10-12 21:02:07,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:01:58" (2/3) ... [2024-10-12 21:02:07,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6420faa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:02:07, skipping insertion in model container [2024-10-12 21:02:07,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:02:07" (3/3) ... [2024-10-12 21:02:07,468 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.15.cil.c [2024-10-12 21:02:07,483 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:02:07,484 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:02:07,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:02:07,617 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;@1abc2df1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:02:07,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:02:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 2500 states, 2461 states have (on average 1.8748476229175133) internal successors, (4614), 2466 states have internal predecessors, (4614), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-12 21:02:07,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:02:07,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:07,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:07,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:07,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:07,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2014249201, now seen corresponding path program 1 times [2024-10-12 21:02:07,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:07,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161297812] [2024-10-12 21:02:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:07,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:08,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:08,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:02:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:08,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:02:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:08,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:02:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:08,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:02:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:08,436 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:02:08,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:08,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161297812] [2024-10-12 21:02:08,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161297812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:08,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:08,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:02:08,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861417969] [2024-10-12 21:02:08,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:08,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:02:08,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:08,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:02:08,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:02:08,484 INFO L87 Difference]: Start difference. First operand has 2500 states, 2461 states have (on average 1.8748476229175133) internal successors, (4614), 2466 states have internal predecessors, (4614), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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:02:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:10,914 INFO L93 Difference]: Finished difference Result 5133 states and 9582 transitions. [2024-10-12 21:02:10,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:02:10,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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 172 [2024-10-12 21:02:10,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:10,953 INFO L225 Difference]: With dead ends: 5133 [2024-10-12 21:02:10,954 INFO L226 Difference]: Without dead ends: 2635 [2024-10-12 21:02:10,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:02:10,973 INFO L432 NwaCegarLoop]: 4283 mSDtfsCounter, 1058 mSDsluCounter, 12236 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 16519 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:10,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 16519 Invalid, 1211 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 21:02:11,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2024-10-12 21:02:11,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2495. [2024-10-12 21:02:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 2458 states have (on average 1.8356387306753459) internal successors, (4512), 2461 states have internal predecessors, (4512), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-12 21:02:11,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 4568 transitions. [2024-10-12 21:02:11,169 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 4568 transitions. Word has length 172 [2024-10-12 21:02:11,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:11,170 INFO L471 AbstractCegarLoop]: Abstraction has 2495 states and 4568 transitions. [2024-10-12 21:02:11,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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:02:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 4568 transitions. [2024-10-12 21:02:11,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:02:11,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:11,180 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:11,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:02:11,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:11,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:11,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1515692399, now seen corresponding path program 1 times [2024-10-12 21:02:11,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:11,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867839686] [2024-10-12 21:02:11,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:11,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:11,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:11,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:02:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:11,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:02:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:11,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:02:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:11,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:02:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:11,553 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:02:11,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:11,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867839686] [2024-10-12 21:02:11,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867839686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:11,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:11,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:02:11,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528884212] [2024-10-12 21:02:11,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:11,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:02:11,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:11,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:02:11,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:02:11,557 INFO L87 Difference]: Start difference. First operand 2495 states and 4568 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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:02:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:13,531 INFO L93 Difference]: Finished difference Result 2994 states and 5402 transitions. [2024-10-12 21:02:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:02:13,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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 172 [2024-10-12 21:02:13,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:13,545 INFO L225 Difference]: With dead ends: 2994 [2024-10-12 21:02:13,545 INFO L226 Difference]: Without dead ends: 2635 [2024-10-12 21:02:13,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:02:13,549 INFO L432 NwaCegarLoop]: 4279 mSDtfsCounter, 1046 mSDsluCounter, 12227 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 16506 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:13,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 16506 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 21:02:13,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2024-10-12 21:02:13,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2495. [2024-10-12 21:02:13,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 2458 states have (on average 1.8352318958502847) internal successors, (4511), 2461 states have internal predecessors, (4511), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-12 21:02:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 4567 transitions. [2024-10-12 21:02:13,622 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 4567 transitions. Word has length 172 [2024-10-12 21:02:13,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:13,623 INFO L471 AbstractCegarLoop]: Abstraction has 2495 states and 4567 transitions. [2024-10-12 21:02:13,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 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:02:13,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 4567 transitions. [2024-10-12 21:02:13,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:02:13,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:13,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:13,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:02:13,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:13,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:13,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1009803283, now seen corresponding path program 1 times [2024-10-12 21:02:13,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:13,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413839953] [2024-10-12 21:02:13,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:13,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:13,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:13,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:02:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:14,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:02:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:14,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:02:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:14,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:02:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:14,055 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:02:14,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:14,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413839953] [2024-10-12 21:02:14,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413839953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:14,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:14,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:02:14,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647474309] [2024-10-12 21:02:14,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:14,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:02:14,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:14,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:02:14,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:02:14,059 INFO L87 Difference]: Start difference. First operand 2495 states and 4567 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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:02:17,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:17,177 INFO L93 Difference]: Finished difference Result 3506 states and 6263 transitions. [2024-10-12 21:02:17,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:02:17,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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 172 [2024-10-12 21:02:17,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:17,197 INFO L225 Difference]: With dead ends: 3506 [2024-10-12 21:02:17,197 INFO L226 Difference]: Without dead ends: 3151 [2024-10-12 21:02:17,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:02:17,204 INFO L432 NwaCegarLoop]: 4245 mSDtfsCounter, 5554 mSDsluCounter, 12730 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5574 SdHoareTripleChecker+Valid, 16975 SdHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:17,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5574 Valid, 16975 Invalid, 2591 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [120 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 21:02:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2024-10-12 21:02:17,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 2870. [2024-10-12 21:02:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2870 states, 2804 states have (on average 1.8131241084165477) internal successors, (5084), 2808 states have internal predecessors, (5084), 51 states have call successors, (51), 13 states have call predecessors, (51), 13 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2024-10-12 21:02:17,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2870 states to 2870 states and 5187 transitions. [2024-10-12 21:02:17,378 INFO L78 Accepts]: Start accepts. Automaton has 2870 states and 5187 transitions. Word has length 172 [2024-10-12 21:02:17,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:17,379 INFO L471 AbstractCegarLoop]: Abstraction has 2870 states and 5187 transitions. [2024-10-12 21:02:17,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 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:02:17,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2870 states and 5187 transitions. [2024-10-12 21:02:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:02:17,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:17,382 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:17,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:02:17,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:17,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:17,383 INFO L85 PathProgramCache]: Analyzing trace with hash -4698007, now seen corresponding path program 1 times [2024-10-12 21:02:17,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:17,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190147990] [2024-10-12 21:02:17,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:17,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:17,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:17,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:02:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:17,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:02:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:17,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:02:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:17,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:02:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:17,718 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:02:17,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:17,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190147990] [2024-10-12 21:02:17,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190147990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:17,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:17,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:17,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367189169] [2024-10-12 21:02:17,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:17,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:17,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:17,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:17,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:17,720 INFO L87 Difference]: Start difference. First operand 2870 states and 5187 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:21,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:21,835 INFO L93 Difference]: Finished difference Result 4417 states and 7785 transitions. [2024-10-12 21:02:21,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:02:21,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-12 21:02:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:21,853 INFO L225 Difference]: With dead ends: 4417 [2024-10-12 21:02:21,853 INFO L226 Difference]: Without dead ends: 3687 [2024-10-12 21:02:21,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:02:21,858 INFO L432 NwaCegarLoop]: 4463 mSDtfsCounter, 5601 mSDsluCounter, 17510 mSDsCounter, 0 mSdLazyCounter, 4012 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5621 SdHoareTripleChecker+Valid, 21973 SdHoareTripleChecker+Invalid, 4079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 4012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:21,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5621 Valid, 21973 Invalid, 4079 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 4012 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-12 21:02:21,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3687 states. [2024-10-12 21:02:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3687 to 3216. [2024-10-12 21:02:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3216 states, 3121 states have (on average 1.793976289650753) internal successors, (5599), 3126 states have internal predecessors, (5599), 73 states have call successors, (73), 19 states have call predecessors, (73), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-12 21:02:22,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 5748 transitions. [2024-10-12 21:02:22,061 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 5748 transitions. Word has length 172 [2024-10-12 21:02:22,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:22,062 INFO L471 AbstractCegarLoop]: Abstraction has 3216 states and 5748 transitions. [2024-10-12 21:02:22,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 5748 transitions. [2024-10-12 21:02:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:02:22,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:22,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:22,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:02:22,066 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:22,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:22,068 INFO L85 PathProgramCache]: Analyzing trace with hash 381164395, now seen corresponding path program 1 times [2024-10-12 21:02:22,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:22,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392496121] [2024-10-12 21:02:22,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:22,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:22,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:22,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:02:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:22,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:02:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:22,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:02:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:22,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:02:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:22,474 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:02:22,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:22,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392496121] [2024-10-12 21:02:22,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392496121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:22,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:22,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:22,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376737888] [2024-10-12 21:02:22,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:22,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:22,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:22,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:22,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:22,478 INFO L87 Difference]: Start difference. First operand 3216 states and 5748 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:24,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:24,465 INFO L93 Difference]: Finished difference Result 4781 states and 8390 transitions. [2024-10-12 21:02:24,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:02:24,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-12 21:02:24,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:24,484 INFO L225 Difference]: With dead ends: 4781 [2024-10-12 21:02:24,484 INFO L226 Difference]: Without dead ends: 3705 [2024-10-12 21:02:24,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:02:24,490 INFO L432 NwaCegarLoop]: 4232 mSDtfsCounter, 5289 mSDsluCounter, 12540 mSDsCounter, 0 mSdLazyCounter, 1851 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5310 SdHoareTripleChecker+Valid, 16772 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:24,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5310 Valid, 16772 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1851 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:02:24,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3705 states. [2024-10-12 21:02:24,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3705 to 3216. [2024-10-12 21:02:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3216 states, 3121 states have (on average 1.7930150592758731) internal successors, (5596), 3126 states have internal predecessors, (5596), 73 states have call successors, (73), 19 states have call predecessors, (73), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-12 21:02:24,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 5745 transitions. [2024-10-12 21:02:24,639 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 5745 transitions. Word has length 172 [2024-10-12 21:02:24,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:24,639 INFO L471 AbstractCegarLoop]: Abstraction has 3216 states and 5745 transitions. [2024-10-12 21:02:24,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 5745 transitions. [2024-10-12 21:02:24,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:02:24,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:24,643 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:24,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:02:24,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:24,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:24,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1982677267, now seen corresponding path program 1 times [2024-10-12 21:02:24,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:24,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658489480] [2024-10-12 21:02:24,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:24,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:24,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:24,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:02:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:24,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:02:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:24,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:02:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:25,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:02:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:25,003 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:02:25,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:25,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658489480] [2024-10-12 21:02:25,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658489480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:25,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:25,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:25,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009759323] [2024-10-12 21:02:25,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:25,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:25,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:25,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:25,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:25,008 INFO L87 Difference]: Start difference. First operand 3216 states and 5745 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:26,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:26,960 INFO L93 Difference]: Finished difference Result 4777 states and 8373 transitions. [2024-10-12 21:02:26,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:02:26,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-12 21:02:26,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:26,979 INFO L225 Difference]: With dead ends: 4777 [2024-10-12 21:02:26,979 INFO L226 Difference]: Without dead ends: 3701 [2024-10-12 21:02:26,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:02:26,988 INFO L432 NwaCegarLoop]: 4232 mSDtfsCounter, 5287 mSDsluCounter, 12540 mSDsCounter, 0 mSdLazyCounter, 1837 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5308 SdHoareTripleChecker+Valid, 16772 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:26,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5308 Valid, 16772 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1837 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:02:26,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3701 states. [2024-10-12 21:02:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3701 to 3216. [2024-10-12 21:02:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3216 states, 3121 states have (on average 1.7920538289009933) internal successors, (5593), 3126 states have internal predecessors, (5593), 73 states have call successors, (73), 19 states have call predecessors, (73), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-12 21:02:27,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 5742 transitions. [2024-10-12 21:02:27,127 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 5742 transitions. Word has length 172 [2024-10-12 21:02:27,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:27,127 INFO L471 AbstractCegarLoop]: Abstraction has 3216 states and 5742 transitions. [2024-10-12 21:02:27,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 5742 transitions. [2024-10-12 21:02:27,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:02:27,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:27,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:27,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:02:27,131 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:27,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:27,131 INFO L85 PathProgramCache]: Analyzing trace with hash 989111083, now seen corresponding path program 1 times [2024-10-12 21:02:27,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:27,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609915638] [2024-10-12 21:02:27,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:27,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:27,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:27,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:02:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:27,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:02:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:27,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:02:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:27,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:02:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:02:27,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:27,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609915638] [2024-10-12 21:02:27,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609915638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:27,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:27,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:27,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062333180] [2024-10-12 21:02:27,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:27,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:27,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:27,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:27,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:27,433 INFO L87 Difference]: Start difference. First operand 3216 states and 5742 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:29,151 INFO L93 Difference]: Finished difference Result 4773 states and 8356 transitions. [2024-10-12 21:02:29,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:02:29,152 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-12 21:02:29,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:29,166 INFO L225 Difference]: With dead ends: 4773 [2024-10-12 21:02:29,167 INFO L226 Difference]: Without dead ends: 3697 [2024-10-12 21:02:29,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:02:29,175 INFO L432 NwaCegarLoop]: 4232 mSDtfsCounter, 5285 mSDsluCounter, 12540 mSDsCounter, 0 mSdLazyCounter, 1823 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5306 SdHoareTripleChecker+Valid, 16772 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:29,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5306 Valid, 16772 Invalid, 1923 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [100 Valid, 1823 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:02:29,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2024-10-12 21:02:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 3216. [2024-10-12 21:02:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3216 states, 3121 states have (on average 1.7910925985261135) internal successors, (5590), 3126 states have internal predecessors, (5590), 73 states have call successors, (73), 19 states have call predecessors, (73), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-12 21:02:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 5739 transitions. [2024-10-12 21:02:29,292 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 5739 transitions. Word has length 172 [2024-10-12 21:02:29,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:29,292 INFO L471 AbstractCegarLoop]: Abstraction has 3216 states and 5739 transitions. [2024-10-12 21:02:29,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 5739 transitions. [2024-10-12 21:02:29,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:02:29,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:29,296 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:29,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:02:29,296 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:29,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1408876755, now seen corresponding path program 1 times [2024-10-12 21:02:29,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:29,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163482463] [2024-10-12 21:02:29,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:29,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:29,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:29,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:02:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:29,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:02:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:29,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:02:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:29,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:02:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:29,594 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:02:29,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:29,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163482463] [2024-10-12 21:02:29,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163482463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:29,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:29,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:29,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991843734] [2024-10-12 21:02:29,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:29,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:29,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:29,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:29,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:29,596 INFO L87 Difference]: Start difference. First operand 3216 states and 5739 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:33,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:33,064 INFO L93 Difference]: Finished difference Result 5739 states and 9934 transitions. [2024-10-12 21:02:33,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:02:33,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-12 21:02:33,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:33,082 INFO L225 Difference]: With dead ends: 5739 [2024-10-12 21:02:33,083 INFO L226 Difference]: Without dead ends: 4663 [2024-10-12 21:02:33,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:02:33,092 INFO L432 NwaCegarLoop]: 4254 mSDtfsCounter, 5686 mSDsluCounter, 16947 mSDsCounter, 0 mSdLazyCounter, 3263 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5706 SdHoareTripleChecker+Valid, 21201 SdHoareTripleChecker+Invalid, 3374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:33,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5706 Valid, 21201 Invalid, 3374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3263 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 21:02:33,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2024-10-12 21:02:33,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 3921. [2024-10-12 21:02:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3768 states have (on average 1.7603503184713376) internal successors, (6633), 3775 states have internal predecessors, (6633), 117 states have call successors, (117), 31 states have call predecessors, (117), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-12 21:02:33,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 6878 transitions. [2024-10-12 21:02:33,240 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 6878 transitions. Word has length 172 [2024-10-12 21:02:33,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:33,241 INFO L471 AbstractCegarLoop]: Abstraction has 3921 states and 6878 transitions. [2024-10-12 21:02:33,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:33,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 6878 transitions. [2024-10-12 21:02:33,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:02:33,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:33,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:33,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:02:33,244 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:33,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:33,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1070589205, now seen corresponding path program 1 times [2024-10-12 21:02:33,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:33,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767151752] [2024-10-12 21:02:33,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:33,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:33,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:33,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:02:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:33,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:02:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:33,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:02:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:33,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:02:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:33,523 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:02:33,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:33,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767151752] [2024-10-12 21:02:33,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767151752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:33,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:33,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:33,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792658223] [2024-10-12 21:02:33,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:33,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:33,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:33,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:33,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:33,526 INFO L87 Difference]: Start difference. First operand 3921 states and 6878 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:35,610 INFO L93 Difference]: Finished difference Result 6429 states and 11059 transitions. [2024-10-12 21:02:35,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:02:35,611 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-12 21:02:35,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:35,624 INFO L225 Difference]: With dead ends: 6429 [2024-10-12 21:02:35,625 INFO L226 Difference]: Without dead ends: 4648 [2024-10-12 21:02:35,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:02:35,631 INFO L432 NwaCegarLoop]: 4232 mSDtfsCounter, 5120 mSDsluCounter, 16675 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5141 SdHoareTripleChecker+Valid, 20907 SdHoareTripleChecker+Invalid, 2064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:35,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5141 Valid, 20907 Invalid, 2064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 21:02:35,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4648 states. [2024-10-12 21:02:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4648 to 3921. [2024-10-12 21:02:35,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3768 states have (on average 1.7590233545647558) internal successors, (6628), 3775 states have internal predecessors, (6628), 117 states have call successors, (117), 31 states have call predecessors, (117), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-12 21:02:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 6873 transitions. [2024-10-12 21:02:35,788 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 6873 transitions. Word has length 172 [2024-10-12 21:02:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:35,789 INFO L471 AbstractCegarLoop]: Abstraction has 3921 states and 6873 transitions. [2024-10-12 21:02:35,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 6873 transitions. [2024-10-12 21:02:35,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:02:35,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:35,792 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:35,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:02:35,792 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:35,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:35,793 INFO L85 PathProgramCache]: Analyzing trace with hash -644034707, now seen corresponding path program 1 times [2024-10-12 21:02:35,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:35,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825286480] [2024-10-12 21:02:35,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:35,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:35,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:35,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:02:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:36,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:02:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:36,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:02:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:36,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:02:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:36,084 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:02:36,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:36,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825286480] [2024-10-12 21:02:36,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825286480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:36,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:36,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:36,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648847386] [2024-10-12 21:02:36,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:36,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:36,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:36,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:36,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:36,087 INFO L87 Difference]: Start difference. First operand 3921 states and 6873 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:39,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:39,876 INFO L93 Difference]: Finished difference Result 8298 states and 14097 transitions. [2024-10-12 21:02:39,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:02:39,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-12 21:02:39,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:39,899 INFO L225 Difference]: With dead ends: 8298 [2024-10-12 21:02:39,899 INFO L226 Difference]: Without dead ends: 6517 [2024-10-12 21:02:39,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:02:39,909 INFO L432 NwaCegarLoop]: 4461 mSDtfsCounter, 5566 mSDsluCounter, 17510 mSDsCounter, 0 mSdLazyCounter, 3878 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5586 SdHoareTripleChecker+Valid, 21971 SdHoareTripleChecker+Invalid, 3947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:39,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5586 Valid, 21971 Invalid, 3947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3878 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 21:02:39,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6517 states. [2024-10-12 21:02:40,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6517 to 5331. [2024-10-12 21:02:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5331 states, 5062 states have (on average 1.7194784670090872) internal successors, (8704), 5073 states have internal predecessors, (8704), 205 states have call successors, (205), 55 states have call predecessors, (205), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-10-12 21:02:40,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5331 states to 5331 states and 9147 transitions. [2024-10-12 21:02:40,142 INFO L78 Accepts]: Start accepts. Automaton has 5331 states and 9147 transitions. Word has length 172 [2024-10-12 21:02:40,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:40,143 INFO L471 AbstractCegarLoop]: Abstraction has 5331 states and 9147 transitions. [2024-10-12 21:02:40,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:40,144 INFO L276 IsEmpty]: Start isEmpty. Operand 5331 states and 9147 transitions. [2024-10-12 21:02:40,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:02:40,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:40,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:40,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:02:40,148 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:40,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:40,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1184464213, now seen corresponding path program 1 times [2024-10-12 21:02:40,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:40,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939159527] [2024-10-12 21:02:40,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:40,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:40,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:40,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:02:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:40,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:02:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:40,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:02:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:40,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:02:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:40,488 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:02:40,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:40,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939159527] [2024-10-12 21:02:40,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939159527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:40,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:40,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:40,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203678672] [2024-10-12 21:02:40,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:40,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:40,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:40,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:40,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:40,490 INFO L87 Difference]: Start difference. First operand 5331 states and 9147 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:44,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:44,440 INFO L93 Difference]: Finished difference Result 13422 states and 22477 transitions. [2024-10-12 21:02:44,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:02:44,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-12 21:02:44,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:44,476 INFO L225 Difference]: With dead ends: 13422 [2024-10-12 21:02:44,476 INFO L226 Difference]: Without dead ends: 10231 [2024-10-12 21:02:44,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:02:44,489 INFO L432 NwaCegarLoop]: 4461 mSDtfsCounter, 5571 mSDsluCounter, 17510 mSDsCounter, 0 mSdLazyCounter, 3860 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5591 SdHoareTripleChecker+Valid, 21971 SdHoareTripleChecker+Invalid, 3929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:44,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5591 Valid, 21971 Invalid, 3929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3860 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 21:02:44,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10231 states. [2024-10-12 21:02:44,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10231 to 8156. [2024-10-12 21:02:44,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8156 states, 7655 states have (on average 1.680209013716525) internal successors, (12862), 7674 states have internal predecessors, (12862), 381 states have call successors, (381), 103 states have call predecessors, (381), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-12 21:02:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8156 states to 8156 states and 13719 transitions. [2024-10-12 21:02:44,930 INFO L78 Accepts]: Start accepts. Automaton has 8156 states and 13719 transitions. Word has length 172 [2024-10-12 21:02:44,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:44,931 INFO L471 AbstractCegarLoop]: Abstraction has 8156 states and 13719 transitions. [2024-10-12 21:02:44,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 8156 states and 13719 transitions. [2024-10-12 21:02:44,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:02:44,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:44,937 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:44,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:02:44,938 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:44,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:44,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1340444755, now seen corresponding path program 1 times [2024-10-12 21:02:44,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:44,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138190349] [2024-10-12 21:02:44,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:44,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:45,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:45,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:02:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:45,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:02:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:45,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:02:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:45,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:02:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:45,291 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:02:45,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:45,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138190349] [2024-10-12 21:02:45,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138190349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:45,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:45,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:45,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585400636] [2024-10-12 21:02:45,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:45,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:45,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:45,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:45,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:45,294 INFO L87 Difference]: Start difference. First operand 8156 states and 13719 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:47,291 INFO L93 Difference]: Finished difference Result 16319 states and 27264 transitions. [2024-10-12 21:02:47,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:02:47,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-12 21:02:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:47,325 INFO L225 Difference]: With dead ends: 16319 [2024-10-12 21:02:47,325 INFO L226 Difference]: Without dead ends: 10303 [2024-10-12 21:02:47,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:02:47,344 INFO L432 NwaCegarLoop]: 4232 mSDtfsCounter, 5124 mSDsluCounter, 16675 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5145 SdHoareTripleChecker+Valid, 20907 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:47,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5145 Valid, 20907 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:02:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10303 states. [2024-10-12 21:02:47,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10303 to 8156. [2024-10-12 21:02:47,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8156 states, 7655 states have (on average 1.6779882429784454) internal successors, (12845), 7674 states have internal predecessors, (12845), 381 states have call successors, (381), 103 states have call predecessors, (381), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-12 21:02:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8156 states to 8156 states and 13702 transitions. [2024-10-12 21:02:47,733 INFO L78 Accepts]: Start accepts. Automaton has 8156 states and 13702 transitions. Word has length 172 [2024-10-12 21:02:47,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:47,733 INFO L471 AbstractCegarLoop]: Abstraction has 8156 states and 13702 transitions. [2024-10-12 21:02:47,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:47,734 INFO L276 IsEmpty]: Start isEmpty. Operand 8156 states and 13702 transitions. [2024-10-12 21:02:47,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:02:47,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:47,739 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:47,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:02:47,739 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:47,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:47,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1166652719, now seen corresponding path program 1 times [2024-10-12 21:02:47,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:47,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61467895] [2024-10-12 21:02:47,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:47,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:47,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:47,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:02:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:47,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:02:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:47,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:02:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:47,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:02:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:47,993 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:02:47,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:47,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61467895] [2024-10-12 21:02:47,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61467895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:47,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:47,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:47,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434087152] [2024-10-12 21:02:47,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:47,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:47,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:47,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:47,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:47,996 INFO L87 Difference]: Start difference. First operand 8156 states and 13702 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:50,232 INFO L93 Difference]: Finished difference Result 16301 states and 27177 transitions. [2024-10-12 21:02:50,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:02:50,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-12 21:02:50,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:50,265 INFO L225 Difference]: With dead ends: 16301 [2024-10-12 21:02:50,266 INFO L226 Difference]: Without dead ends: 10285 [2024-10-12 21:02:50,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:02:50,286 INFO L432 NwaCegarLoop]: 4232 mSDtfsCounter, 5122 mSDsluCounter, 16675 mSDsCounter, 0 mSdLazyCounter, 1928 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5143 SdHoareTripleChecker+Valid, 20907 SdHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:50,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5143 Valid, 20907 Invalid, 1999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1928 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 21:02:50,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10285 states. [2024-10-12 21:02:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10285 to 8156. [2024-10-12 21:02:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8156 states, 7655 states have (on average 1.6757674722403657) internal successors, (12828), 7674 states have internal predecessors, (12828), 381 states have call successors, (381), 103 states have call predecessors, (381), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-12 21:02:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8156 states to 8156 states and 13685 transitions. [2024-10-12 21:02:50,734 INFO L78 Accepts]: Start accepts. Automaton has 8156 states and 13685 transitions. Word has length 172 [2024-10-12 21:02:50,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:50,735 INFO L471 AbstractCegarLoop]: Abstraction has 8156 states and 13685 transitions. [2024-10-12 21:02:50,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:50,735 INFO L276 IsEmpty]: Start isEmpty. Operand 8156 states and 13685 transitions. [2024-10-12 21:02:50,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:02:50,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:50,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:50,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:02:50,742 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:50,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:50,742 INFO L85 PathProgramCache]: Analyzing trace with hash -969230483, now seen corresponding path program 1 times [2024-10-12 21:02:50,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:50,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430011954] [2024-10-12 21:02:50,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:50,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:50,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:50,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:02:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:50,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:02:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:50,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:02:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:51,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:02:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:51,003 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:02:51,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:51,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430011954] [2024-10-12 21:02:51,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430011954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:51,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:51,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:51,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688296711] [2024-10-12 21:02:51,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:51,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:51,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:51,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:51,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:51,005 INFO L87 Difference]: Start difference. First operand 8156 states and 13685 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:55,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:02:55,134 INFO L93 Difference]: Finished difference Result 23615 states and 39019 transitions. [2024-10-12 21:02:55,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:02:55,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-12 21:02:55,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:02:55,201 INFO L225 Difference]: With dead ends: 23615 [2024-10-12 21:02:55,201 INFO L226 Difference]: Without dead ends: 17599 [2024-10-12 21:02:55,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:02:55,227 INFO L432 NwaCegarLoop]: 4461 mSDtfsCounter, 5552 mSDsluCounter, 17510 mSDsCounter, 0 mSdLazyCounter, 3783 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5572 SdHoareTripleChecker+Valid, 21971 SdHoareTripleChecker+Invalid, 3852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:02:55,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5572 Valid, 21971 Invalid, 3852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3783 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 21:02:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17599 states. [2024-10-12 21:02:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17599 to 13872. [2024-10-12 21:02:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13872 states, 12907 states have (on average 1.642829472379329) internal successors, (21204), 12942 states have internal predecessors, (21204), 733 states have call successors, (733), 199 states have call predecessors, (733), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-10-12 21:02:56,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13872 states to 13872 states and 22943 transitions. [2024-10-12 21:02:56,143 INFO L78 Accepts]: Start accepts. Automaton has 13872 states and 22943 transitions. Word has length 172 [2024-10-12 21:02:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:02:56,143 INFO L471 AbstractCegarLoop]: Abstraction has 13872 states and 22943 transitions. [2024-10-12 21:02:56,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:02:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 13872 states and 22943 transitions. [2024-10-12 21:02:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:02:56,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:02:56,152 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:02:56,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:02:56,152 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:02:56,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:02:56,153 INFO L85 PathProgramCache]: Analyzing trace with hash -899582609, now seen corresponding path program 1 times [2024-10-12 21:02:56,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:02:56,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523416450] [2024-10-12 21:02:56,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:02:56,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:02:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:56,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:02:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:56,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:02:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:56,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:02:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:56,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:02:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:56,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:02:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:02:56,433 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:02:56,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:02:56,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523416450] [2024-10-12 21:02:56,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523416450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:02:56,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:02:56,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:02:56,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566571559] [2024-10-12 21:02:56,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:02:56,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:02:56,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:02:56,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:02:56,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:02:56,435 INFO L87 Difference]: Start difference. First operand 13872 states and 22943 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:03:01,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:03:01,407 INFO L93 Difference]: Finished difference Result 49361 states and 81209 transitions. [2024-10-12 21:03:01,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:03:01,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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 172 [2024-10-12 21:03:01,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:03:01,526 INFO L225 Difference]: With dead ends: 49361 [2024-10-12 21:03:01,526 INFO L226 Difference]: Without dead ends: 37629 [2024-10-12 21:03:01,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:03:01,562 INFO L432 NwaCegarLoop]: 4256 mSDtfsCounter, 6118 mSDsluCounter, 16945 mSDsCounter, 0 mSdLazyCounter, 3169 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6152 SdHoareTripleChecker+Valid, 21201 SdHoareTripleChecker+Invalid, 3283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 3169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:03:01,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6152 Valid, 21201 Invalid, 3283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 3169 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 21:03:01,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37629 states. [2024-10-12 21:03:03,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37629 to 25265. [2024-10-12 21:03:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25265 states, 23404 states have (on average 1.6218595111946676) internal successors, (37958), 23471 states have internal predecessors, (37958), 1405 states have call successors, (1405), 391 states have call predecessors, (1405), 454 states have return successors, (2196), 1466 states have call predecessors, (2196), 1403 states have call successors, (2196) [2024-10-12 21:03:03,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25265 states to 25265 states and 41559 transitions. [2024-10-12 21:03:03,431 INFO L78 Accepts]: Start accepts. Automaton has 25265 states and 41559 transitions. Word has length 172 [2024-10-12 21:03:03,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:03:03,432 INFO L471 AbstractCegarLoop]: Abstraction has 25265 states and 41559 transitions. [2024-10-12 21:03:03,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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:03:03,432 INFO L276 IsEmpty]: Start isEmpty. Operand 25265 states and 41559 transitions. [2024-10-12 21:03:03,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:03:03,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:03:03,450 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:03:03,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:03:03,450 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:03:03,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:03:03,451 INFO L85 PathProgramCache]: Analyzing trace with hash -481693907, now seen corresponding path program 1 times [2024-10-12 21:03:03,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:03:03,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39823246] [2024-10-12 21:03:03,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:03:03,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:03:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:03,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:03:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:03,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:03:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:03,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:03:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:03,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:03:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:03,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:03:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:03:03,785 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:03:03,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:03:03,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39823246] [2024-10-12 21:03:03,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39823246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:03:03,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:03:03,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:03:03,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644738000] [2024-10-12 21:03:03,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:03:03,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:03:03,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:03:03,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:03:03,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:03:03,790 INFO L87 Difference]: Start difference. First operand 25265 states and 41559 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 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)