./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_label46+token_ring.15.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_label46+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 5a40438206222cb8b2973fadc665b92d328ce78e3a9921112a2f9717aab2538e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:32:33,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:32:33,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 04:32:33,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:32:33,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:32:33,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:32:33,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:32:33,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:32:33,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:32:33,242 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:32:33,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:32:33,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:32:33,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:32:33,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:32:33,244 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:32:33,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:32:33,246 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:32:33,248 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:32:33,248 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 04:32:33,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:32:33,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:32:33,249 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:32:33,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:32:33,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:32:33,250 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:32:33,250 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:32:33,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:32:33,250 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:32:33,250 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:32:33,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:32:33,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:32:33,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:32:33,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:32:33,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:32:33,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:32:33,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:32:33,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 04:32:33,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 04:32:33,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:32:33,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:32:33,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:32:33,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:32:33,253 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 -> 5a40438206222cb8b2973fadc665b92d328ce78e3a9921112a2f9717aab2538e [2024-10-14 04:32:33,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:32:33,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:32:33,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:32:33,454 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:32:33,455 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:32:33,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.15.cil.c [2024-10-14 04:32:34,661 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:32:35,108 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:32:35,109 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.15.cil.c [2024-10-14 04:32:35,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa341f5a0/7110866957c94deb96e99fbca4501942/FLAGcdc2a080a [2024-10-14 04:32:35,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa341f5a0/7110866957c94deb96e99fbca4501942 [2024-10-14 04:32:35,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:32:35,167 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:32:35,168 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:32:35,168 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:32:35,172 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:32:35,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:32:35" (1/1) ... [2024-10-14 04:32:35,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8b616e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:32:35, skipping insertion in model container [2024-10-14 04:32:35,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:32:35" (1/1) ... [2024-10-14 04:32:35,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:32:36,506 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_label46+token_ring.15.cil.c[382357,382370] [2024-10-14 04:32:36,528 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_label46+token_ring.15.cil.c[383339,383352] [2024-10-14 04:32:36,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:32:36,733 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:32:37,262 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_label46+token_ring.15.cil.c[382357,382370] [2024-10-14 04:32:37,266 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_label46+token_ring.15.cil.c[383339,383352] [2024-10-14 04:32:37,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:32:37,335 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:32:37,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:32:37 WrapperNode [2024-10-14 04:32:37,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:32:37,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:32:37,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:32:37,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:32:37,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:32:37" (1/1) ... [2024-10-14 04:32:37,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:32:37" (1/1) ... [2024-10-14 04:32:37,714 INFO L138 Inliner]: procedures = 70, calls = 81, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 13297 [2024-10-14 04:32:37,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:32:37,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:32:37,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:32:37,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:32:37,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:32:37" (1/1) ... [2024-10-14 04:32:37,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:32:37" (1/1) ... [2024-10-14 04:32:37,763 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:32:37" (1/1) ... [2024-10-14 04:32:37,828 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-14 04:32:37,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:32:37" (1/1) ... [2024-10-14 04:32:37,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:32:37" (1/1) ... [2024-10-14 04:32:37,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:32:37" (1/1) ... [2024-10-14 04:32:38,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:32:37" (1/1) ... [2024-10-14 04:32:38,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:32:37" (1/1) ... [2024-10-14 04:32:38,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:32:37" (1/1) ... [2024-10-14 04:32:38,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:32:38,142 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:32:38,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:32:38,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:32:38,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:32:37" (1/1) ... [2024-10-14 04:32:38,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:32:38,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:32:38,167 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-14 04:32:38,168 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-14 04:32:38,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:32:38,200 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 04:32:38,200 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 04:32:38,200 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 04:32:38,200 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 04:32:38,200 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 04:32:38,200 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 04:32:38,200 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-14 04:32:38,201 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-14 04:32:38,201 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 04:32:38,201 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 04:32:38,201 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 04:32:38,201 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 04:32:38,201 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 04:32:38,201 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 04:32:38,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 04:32:38,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:32:38,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:32:38,310 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:32:38,312 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:32:43,955 INFO L? ?]: Removed 1765 outVars from TransFormulas that were not future-live. [2024-10-14 04:32:43,955 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:32:44,057 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:32:44,057 INFO L314 CfgBuilder]: Removed 17 assume(true) statements. [2024-10-14 04:32:44,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:32:44 BoogieIcfgContainer [2024-10-14 04:32:44,058 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:32:44,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:32:44,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:32:44,063 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:32:44,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:32:35" (1/3) ... [2024-10-14 04:32:44,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1ff877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:32:44, skipping insertion in model container [2024-10-14 04:32:44,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:32:37" (2/3) ... [2024-10-14 04:32:44,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1ff877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:32:44, skipping insertion in model container [2024-10-14 04:32:44,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:32:44" (3/3) ... [2024-10-14 04:32:44,065 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.15.cil.c [2024-10-14 04:32:44,077 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:32:44,077 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 04:32:44,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:32:44,182 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;@65764ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:32:44,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 04:32:44,195 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-14 04:32:44,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 04:32:44,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:32:44,210 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-14 04:32:44,211 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:32:44,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:32:44,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1330018896, now seen corresponding path program 1 times [2024-10-14 04:32:44,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:32:44,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931997825] [2024-10-14 04:32:44,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:32:44,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:32:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:44,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:32:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:44,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:32:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:44,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:32:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:44,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:32:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:44,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:32:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:44,755 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-14 04:32:44,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:32:44,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931997825] [2024-10-14 04:32:44,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931997825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:32:44,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:32:44,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 04:32:44,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857490033] [2024-10-14 04:32:44,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:32:44,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:32:44,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:32:44,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:32:44,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:32:44,785 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-14 04:32:46,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:32:46,696 INFO L93 Difference]: Finished difference Result 5133 states and 9582 transitions. [2024-10-14 04:32:46,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:32:46,698 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-14 04:32:46,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:32:46,726 INFO L225 Difference]: With dead ends: 5133 [2024-10-14 04:32:46,727 INFO L226 Difference]: Without dead ends: 2635 [2024-10-14 04:32:46,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 04:32:46,739 INFO L432 NwaCegarLoop]: 4283 mSDtfsCounter, 1058 mSDsluCounter, 12236 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2024-10-14 04:32:46,739 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.4s Time] [2024-10-14 04:32:46,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2024-10-14 04:32:46,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2495. [2024-10-14 04:32:46,849 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-14 04:32:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 4568 transitions. [2024-10-14 04:32:46,945 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 4568 transitions. Word has length 172 [2024-10-14 04:32:46,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:32:46,945 INFO L471 AbstractCegarLoop]: Abstraction has 2495 states and 4568 transitions. [2024-10-14 04:32:46,945 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-14 04:32:46,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 4568 transitions. [2024-10-14 04:32:46,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 04:32:46,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:32:46,949 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-14 04:32:46,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 04:32:46,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:32:46,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:32:46,951 INFO L85 PathProgramCache]: Analyzing trace with hash 831462094, now seen corresponding path program 1 times [2024-10-14 04:32:46,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:32:46,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353592153] [2024-10-14 04:32:46,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:32:46,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:32:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:47,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:32:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:47,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:32:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:47,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:32:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:47,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:32:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:47,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:32:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:47,164 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-14 04:32:47,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:32:47,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353592153] [2024-10-14 04:32:47,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353592153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:32:47,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:32:47,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 04:32:47,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344440484] [2024-10-14 04:32:47,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:32:47,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:32:47,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:32:47,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:32:47,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:32:47,171 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-14 04:32:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:32:48,691 INFO L93 Difference]: Finished difference Result 2994 states and 5402 transitions. [2024-10-14 04:32:48,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:32:48,691 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-14 04:32:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:32:48,700 INFO L225 Difference]: With dead ends: 2994 [2024-10-14 04:32:48,700 INFO L226 Difference]: Without dead ends: 2635 [2024-10-14 04:32:48,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 04:32:48,703 INFO L432 NwaCegarLoop]: 4279 mSDtfsCounter, 1046 mSDsluCounter, 12227 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:32:48,703 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.2s Time] [2024-10-14 04:32:48,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2024-10-14 04:32:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2495. [2024-10-14 04:32:48,747 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-14 04:32:48,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 4567 transitions. [2024-10-14 04:32:48,753 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 4567 transitions. Word has length 172 [2024-10-14 04:32:48,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:32:48,753 INFO L471 AbstractCegarLoop]: Abstraction has 2495 states and 4567 transitions. [2024-10-14 04:32:48,753 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-14 04:32:48,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 4567 transitions. [2024-10-14 04:32:48,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 04:32:48,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:32:48,757 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-14 04:32:48,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 04:32:48,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:32:48,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:32:48,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1694033588, now seen corresponding path program 1 times [2024-10-14 04:32:48,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:32:48,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804564030] [2024-10-14 04:32:48,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:32:48,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:32:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:48,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:32:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:48,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:32:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:49,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:32:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:49,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:32:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:49,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:32:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:49,075 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-14 04:32:49,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:32:49,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804564030] [2024-10-14 04:32:49,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804564030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:32:49,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:32:49,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:32:49,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933480461] [2024-10-14 04:32:49,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:32:49,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:32:49,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:32:49,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:32:49,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:32:49,078 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-14 04:32:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:32:51,588 INFO L93 Difference]: Finished difference Result 3506 states and 6263 transitions. [2024-10-14 04:32:51,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 04:32:51,590 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-14 04:32:51,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:32:51,601 INFO L225 Difference]: With dead ends: 3506 [2024-10-14 04:32:51,602 INFO L226 Difference]: Without dead ends: 3151 [2024-10-14 04:32:51,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:32:51,607 INFO L432 NwaCegarLoop]: 4245 mSDtfsCounter, 5554 mSDsluCounter, 12730 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5574 SdHoareTripleChecker+Valid, 16975 SdHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:32:51,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5574 Valid, 16975 Invalid, 2591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 04:32:51,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2024-10-14 04:32:51,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 2870. [2024-10-14 04:32:51,674 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-14 04:32:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2870 states to 2870 states and 5187 transitions. [2024-10-14 04:32:51,681 INFO L78 Accepts]: Start accepts. Automaton has 2870 states and 5187 transitions. Word has length 172 [2024-10-14 04:32:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:32:51,682 INFO L471 AbstractCegarLoop]: Abstraction has 2870 states and 5187 transitions. [2024-10-14 04:32:51,682 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-14 04:32:51,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2870 states and 5187 transitions. [2024-10-14 04:32:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 04:32:51,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:32:51,684 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-14 04:32:51,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 04:32:51,684 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:32:51,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:32:51,685 INFO L85 PathProgramCache]: Analyzing trace with hash -688928312, now seen corresponding path program 1 times [2024-10-14 04:32:51,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:32:51,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144810064] [2024-10-14 04:32:51,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:32:51,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:32:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:51,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:32:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:51,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:32:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:51,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:32:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:51,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:32:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:51,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:32:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:51,965 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-14 04:32:51,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:32:51,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144810064] [2024-10-14 04:32:51,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144810064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:32:51,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:32:51,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:32:51,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847226132] [2024-10-14 04:32:51,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:32:51,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:32:51,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:32:51,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:32:51,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:32:51,967 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-14 04:32:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:32:55,267 INFO L93 Difference]: Finished difference Result 4417 states and 7785 transitions. [2024-10-14 04:32:55,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:32:55,268 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-14 04:32:55,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:32:55,279 INFO L225 Difference]: With dead ends: 4417 [2024-10-14 04:32:55,279 INFO L226 Difference]: Without dead ends: 3687 [2024-10-14 04:32:55,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:32:55,282 INFO L432 NwaCegarLoop]: 4463 mSDtfsCounter, 5601 mSDsluCounter, 17510 mSDsCounter, 0 mSdLazyCounter, 4012 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5621 SdHoareTripleChecker+Valid, 21973 SdHoareTripleChecker+Invalid, 4079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 4012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 04:32:55,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5621 Valid, 21973 Invalid, 4079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 4012 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 04:32:55,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3687 states. [2024-10-14 04:32:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3687 to 3216. [2024-10-14 04:32:55,356 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-14 04:32:55,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 5748 transitions. [2024-10-14 04:32:55,365 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 5748 transitions. Word has length 172 [2024-10-14 04:32:55,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:32:55,365 INFO L471 AbstractCegarLoop]: Abstraction has 3216 states and 5748 transitions. [2024-10-14 04:32:55,365 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-14 04:32:55,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 5748 transitions. [2024-10-14 04:32:55,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 04:32:55,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:32:55,369 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-14 04:32:55,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 04:32:55,370 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:32:55,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:32:55,370 INFO L85 PathProgramCache]: Analyzing trace with hash -303065910, now seen corresponding path program 1 times [2024-10-14 04:32:55,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:32:55,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922281499] [2024-10-14 04:32:55,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:32:55,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:32:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:55,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:32:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:55,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:32:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:55,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:32:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:55,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:32:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:55,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:32:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:55,597 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-14 04:32:55,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:32:55,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922281499] [2024-10-14 04:32:55,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922281499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:32:55,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:32:55,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:32:55,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981941117] [2024-10-14 04:32:55,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:32:55,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:32:55,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:32:55,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:32:55,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:32:55,600 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-14 04:32:57,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:32:57,153 INFO L93 Difference]: Finished difference Result 4781 states and 8390 transitions. [2024-10-14 04:32:57,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:32:57,154 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-14 04:32:57,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:32:57,166 INFO L225 Difference]: With dead ends: 4781 [2024-10-14 04:32:57,166 INFO L226 Difference]: Without dead ends: 3705 [2024-10-14 04:32:57,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:32:57,170 INFO L432 NwaCegarLoop]: 4232 mSDtfsCounter, 5289 mSDsluCounter, 12540 mSDsCounter, 0 mSdLazyCounter, 1851 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:32:57,171 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.2s Time] [2024-10-14 04:32:57,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3705 states. [2024-10-14 04:32:57,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3705 to 3216. [2024-10-14 04:32:57,283 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-14 04:32:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 5745 transitions. [2024-10-14 04:32:57,291 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 5745 transitions. Word has length 172 [2024-10-14 04:32:57,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:32:57,292 INFO L471 AbstractCegarLoop]: Abstraction has 3216 states and 5745 transitions. [2024-10-14 04:32:57,292 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-14 04:32:57,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 5745 transitions. [2024-10-14 04:32:57,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 04:32:57,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:32:57,294 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-14 04:32:57,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 04:32:57,295 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:32:57,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:32:57,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1628059724, now seen corresponding path program 1 times [2024-10-14 04:32:57,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:32:57,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697863228] [2024-10-14 04:32:57,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:32:57,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:32:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:57,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:32:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:57,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:32:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:57,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:32:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:57,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:32:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:57,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:32:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:57,544 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-14 04:32:57,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:32:57,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697863228] [2024-10-14 04:32:57,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697863228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:32:57,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:32:57,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:32:57,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619355942] [2024-10-14 04:32:57,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:32:57,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:32:57,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:32:57,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:32:57,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:32:57,547 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-14 04:32:59,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:32:59,247 INFO L93 Difference]: Finished difference Result 4777 states and 8373 transitions. [2024-10-14 04:32:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:32:59,248 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-14 04:32:59,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:32:59,261 INFO L225 Difference]: With dead ends: 4777 [2024-10-14 04:32:59,261 INFO L226 Difference]: Without dead ends: 3701 [2024-10-14 04:32:59,265 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-14 04:32:59,266 INFO L432 NwaCegarLoop]: 4232 mSDtfsCounter, 5287 mSDsluCounter, 12540 mSDsCounter, 0 mSdLazyCounter, 1837 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:32:59,266 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.2s Time] [2024-10-14 04:32:59,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3701 states. [2024-10-14 04:32:59,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3701 to 3216. [2024-10-14 04:32:59,379 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-14 04:32:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 5742 transitions. [2024-10-14 04:32:59,388 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 5742 transitions. Word has length 172 [2024-10-14 04:32:59,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:32:59,388 INFO L471 AbstractCegarLoop]: Abstraction has 3216 states and 5742 transitions. [2024-10-14 04:32:59,388 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-14 04:32:59,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 5742 transitions. [2024-10-14 04:32:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 04:32:59,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:32:59,390 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-14 04:32:59,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 04:32:59,390 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:32:59,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:32:59,390 INFO L85 PathProgramCache]: Analyzing trace with hash 304880778, now seen corresponding path program 1 times [2024-10-14 04:32:59,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:32:59,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106631769] [2024-10-14 04:32:59,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:32:59,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:32:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:59,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:32:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:59,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:32:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:59,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:32:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:59,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:32:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:59,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:32:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:32:59,587 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-14 04:32:59,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:32:59,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106631769] [2024-10-14 04:32:59,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106631769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:32:59,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:32:59,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:32:59,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787200417] [2024-10-14 04:32:59,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:32:59,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:32:59,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:32:59,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:32:59,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:32:59,589 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-14 04:33:00,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:33:00,997 INFO L93 Difference]: Finished difference Result 4773 states and 8356 transitions. [2024-10-14 04:33:00,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:33:00,998 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-14 04:33:00,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:33:01,010 INFO L225 Difference]: With dead ends: 4773 [2024-10-14 04:33:01,011 INFO L226 Difference]: Without dead ends: 3697 [2024-10-14 04:33:01,013 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-14 04:33:01,014 INFO L432 NwaCegarLoop]: 4232 mSDtfsCounter, 5285 mSDsluCounter, 12540 mSDsCounter, 0 mSdLazyCounter, 1823 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5306 SdHoareTripleChecker+Valid, 16772 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:33:01,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5306 Valid, 16772 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1823 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 04:33:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2024-10-14 04:33:01,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 3216. [2024-10-14 04:33:01,087 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-14 04:33:01,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 5739 transitions. [2024-10-14 04:33:01,092 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 5739 transitions. Word has length 172 [2024-10-14 04:33:01,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:33:01,092 INFO L471 AbstractCegarLoop]: Abstraction has 3216 states and 5739 transitions. [2024-10-14 04:33:01,092 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-14 04:33:01,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 5739 transitions. [2024-10-14 04:33:01,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 04:33:01,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:33:01,095 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-14 04:33:01,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 04:33:01,095 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:33:01,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:33:01,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2093107060, now seen corresponding path program 1 times [2024-10-14 04:33:01,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:33:01,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254900458] [2024-10-14 04:33:01,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:33:01,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:33:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:01,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:33:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:01,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:33:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:01,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:33:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:01,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:33:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:01,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:33:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 04:33:01,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:33:01,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254900458] [2024-10-14 04:33:01,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254900458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:33:01,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:33:01,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:33:01,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872194173] [2024-10-14 04:33:01,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:33:01,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:33:01,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:33:01,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:33:01,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:33:01,338 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-14 04:33:04,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:33:04,131 INFO L93 Difference]: Finished difference Result 5739 states and 9934 transitions. [2024-10-14 04:33:04,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:33:04,132 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-14 04:33:04,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:33:04,145 INFO L225 Difference]: With dead ends: 5739 [2024-10-14 04:33:04,145 INFO L226 Difference]: Without dead ends: 4663 [2024-10-14 04:33:04,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:33:04,149 INFO L432 NwaCegarLoop]: 4254 mSDtfsCounter, 5686 mSDsluCounter, 16947 mSDsCounter, 0 mSdLazyCounter, 3263 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:33:04,150 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.0s Time] [2024-10-14 04:33:04,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2024-10-14 04:33:04,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 3921. [2024-10-14 04:33:04,329 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-14 04:33:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 6878 transitions. [2024-10-14 04:33:04,334 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 6878 transitions. Word has length 172 [2024-10-14 04:33:04,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:33:04,336 INFO L471 AbstractCegarLoop]: Abstraction has 3921 states and 6878 transitions. [2024-10-14 04:33:04,336 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-14 04:33:04,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 6878 transitions. [2024-10-14 04:33:04,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 04:33:04,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:33:04,341 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-14 04:33:04,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 04:33:04,342 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:33:04,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:33:04,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1754819510, now seen corresponding path program 1 times [2024-10-14 04:33:04,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:33:04,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590494613] [2024-10-14 04:33:04,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:33:04,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:33:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:04,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:33:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:04,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:33:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:04,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:33:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:04,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:33:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:04,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:33:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:04,570 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-14 04:33:04,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:33:04,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590494613] [2024-10-14 04:33:04,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590494613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:33:04,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:33:04,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:33:04,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708682370] [2024-10-14 04:33:04,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:33:04,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:33:04,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:33:04,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:33:04,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:33:04,573 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-14 04:33:06,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:33:06,143 INFO L93 Difference]: Finished difference Result 6429 states and 11059 transitions. [2024-10-14 04:33:06,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:33:06,143 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-14 04:33:06,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:33:06,153 INFO L225 Difference]: With dead ends: 6429 [2024-10-14 04:33:06,153 INFO L226 Difference]: Without dead ends: 4648 [2024-10-14 04:33:06,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:33:06,158 INFO L432 NwaCegarLoop]: 4232 mSDtfsCounter, 5120 mSDsluCounter, 16675 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:33:06,159 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.2s Time] [2024-10-14 04:33:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4648 states. [2024-10-14 04:33:06,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4648 to 3921. [2024-10-14 04:33:06,268 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-14 04:33:06,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 6873 transitions. [2024-10-14 04:33:06,273 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 6873 transitions. Word has length 172 [2024-10-14 04:33:06,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:33:06,273 INFO L471 AbstractCegarLoop]: Abstraction has 3921 states and 6873 transitions. [2024-10-14 04:33:06,274 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-14 04:33:06,274 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 6873 transitions. [2024-10-14 04:33:06,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 04:33:06,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:33:06,275 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-14 04:33:06,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 04:33:06,276 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:33:06,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:33:06,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1328265012, now seen corresponding path program 1 times [2024-10-14 04:33:06,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:33:06,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968449447] [2024-10-14 04:33:06,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:33:06,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:33:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:06,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:33:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:06,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:33:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:06,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:33:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:06,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:33:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:06,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:33:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:06,489 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-14 04:33:06,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:33:06,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968449447] [2024-10-14 04:33:06,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968449447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:33:06,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:33:06,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:33:06,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87582265] [2024-10-14 04:33:06,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:33:06,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:33:06,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:33:06,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:33:06,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:33:06,491 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-14 04:33:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:33:09,628 INFO L93 Difference]: Finished difference Result 8298 states and 14097 transitions. [2024-10-14 04:33:09,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:33:09,629 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-14 04:33:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:33:09,648 INFO L225 Difference]: With dead ends: 8298 [2024-10-14 04:33:09,652 INFO L226 Difference]: Without dead ends: 6517 [2024-10-14 04:33:09,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:33:09,662 INFO L432 NwaCegarLoop]: 4461 mSDtfsCounter, 5566 mSDsluCounter, 17510 mSDsCounter, 0 mSdLazyCounter, 3878 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.3s IncrementalHoareTripleChecker+Time [2024-10-14 04:33:09,662 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.3s Time] [2024-10-14 04:33:09,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6517 states. [2024-10-14 04:33:09,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6517 to 5331. [2024-10-14 04:33:09,828 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-14 04:33:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5331 states to 5331 states and 9147 transitions. [2024-10-14 04:33:09,837 INFO L78 Accepts]: Start accepts. Automaton has 5331 states and 9147 transitions. Word has length 172 [2024-10-14 04:33:09,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:33:09,838 INFO L471 AbstractCegarLoop]: Abstraction has 5331 states and 9147 transitions. [2024-10-14 04:33:09,838 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-14 04:33:09,838 INFO L276 IsEmpty]: Start isEmpty. Operand 5331 states and 9147 transitions. [2024-10-14 04:33:09,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 04:33:09,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:33:09,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:33:09,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 04:33:09,841 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:33:09,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:33:09,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1868694518, now seen corresponding path program 1 times [2024-10-14 04:33:09,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:33:09,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233888957] [2024-10-14 04:33:09,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:33:09,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:33:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:09,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:33:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:09,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:33:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:10,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:33:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:10,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:33:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:10,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:33:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:10,040 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-14 04:33:10,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:33:10,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233888957] [2024-10-14 04:33:10,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233888957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:33:10,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:33:10,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:33:10,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817799006] [2024-10-14 04:33:10,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:33:10,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:33:10,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:33:10,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:33:10,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:33:10,042 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-14 04:33:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:33:13,507 INFO L93 Difference]: Finished difference Result 13422 states and 22477 transitions. [2024-10-14 04:33:13,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:33:13,508 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-14 04:33:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:33:13,533 INFO L225 Difference]: With dead ends: 13422 [2024-10-14 04:33:13,533 INFO L226 Difference]: Without dead ends: 10231 [2024-10-14 04:33:13,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:33:13,543 INFO L432 NwaCegarLoop]: 4461 mSDtfsCounter, 5571 mSDsluCounter, 17510 mSDsCounter, 0 mSdLazyCounter, 3860 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:33:13,543 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.2s Time] [2024-10-14 04:33:13,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10231 states. [2024-10-14 04:33:13,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10231 to 8156. [2024-10-14 04:33:13,844 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-14 04:33:13,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8156 states to 8156 states and 13719 transitions. [2024-10-14 04:33:13,859 INFO L78 Accepts]: Start accepts. Automaton has 8156 states and 13719 transitions. Word has length 172 [2024-10-14 04:33:13,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:33:13,859 INFO L471 AbstractCegarLoop]: Abstraction has 8156 states and 13719 transitions. [2024-10-14 04:33:13,859 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-14 04:33:13,859 INFO L276 IsEmpty]: Start isEmpty. Operand 8156 states and 13719 transitions. [2024-10-14 04:33:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 04:33:13,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:33:13,863 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-14 04:33:13,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 04:33:13,863 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:33:13,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:33:13,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2024675060, now seen corresponding path program 1 times [2024-10-14 04:33:13,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:33:13,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143295549] [2024-10-14 04:33:13,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:33:13,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:33:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:13,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:33:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:13,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:33:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:14,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:33:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:14,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:33:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:14,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:33:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:14,044 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-14 04:33:14,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:33:14,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143295549] [2024-10-14 04:33:14,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143295549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:33:14,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:33:14,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:33:14,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757160828] [2024-10-14 04:33:14,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:33:14,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:33:14,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:33:14,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:33:14,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:33:14,046 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-14 04:33:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:33:15,912 INFO L93 Difference]: Finished difference Result 16319 states and 27264 transitions. [2024-10-14 04:33:15,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:33:15,912 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-14 04:33:15,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:33:15,937 INFO L225 Difference]: With dead ends: 16319 [2024-10-14 04:33:15,938 INFO L226 Difference]: Without dead ends: 10303 [2024-10-14 04:33:15,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:33:15,953 INFO L432 NwaCegarLoop]: 4232 mSDtfsCounter, 5124 mSDsluCounter, 16675 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:33:15,953 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.2s Time] [2024-10-14 04:33:15,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10303 states. [2024-10-14 04:33:16,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10303 to 8156. [2024-10-14 04:33:16,255 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-14 04:33:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8156 states to 8156 states and 13702 transitions. [2024-10-14 04:33:16,273 INFO L78 Accepts]: Start accepts. Automaton has 8156 states and 13702 transitions. Word has length 172 [2024-10-14 04:33:16,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:33:16,274 INFO L471 AbstractCegarLoop]: Abstraction has 8156 states and 13702 transitions. [2024-10-14 04:33:16,274 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-14 04:33:16,274 INFO L276 IsEmpty]: Start isEmpty. Operand 8156 states and 13702 transitions. [2024-10-14 04:33:16,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 04:33:16,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:33:16,278 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-14 04:33:16,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 04:33:16,278 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:33:16,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:33:16,279 INFO L85 PathProgramCache]: Analyzing trace with hash 482422414, now seen corresponding path program 1 times [2024-10-14 04:33:16,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:33:16,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232502416] [2024-10-14 04:33:16,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:33:16,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:33:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:16,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:33:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:16,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:33:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:16,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:33:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:16,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:33:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:16,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:33:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:16,465 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-14 04:33:16,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:33:16,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232502416] [2024-10-14 04:33:16,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232502416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:33:16,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:33:16,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:33:16,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420407848] [2024-10-14 04:33:16,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:33:16,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:33:16,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:33:16,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:33:16,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:33:16,468 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-14 04:33:18,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:33:18,326 INFO L93 Difference]: Finished difference Result 16301 states and 27177 transitions. [2024-10-14 04:33:18,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:33:18,326 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-14 04:33:18,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:33:18,349 INFO L225 Difference]: With dead ends: 16301 [2024-10-14 04:33:18,349 INFO L226 Difference]: Without dead ends: 10285 [2024-10-14 04:33:18,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:33:18,361 INFO L432 NwaCegarLoop]: 4232 mSDtfsCounter, 5122 mSDsluCounter, 16675 mSDsCounter, 0 mSdLazyCounter, 1928 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:33:18,361 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.2s Time] [2024-10-14 04:33:18,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10285 states. [2024-10-14 04:33:18,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10285 to 8156. [2024-10-14 04:33:18,672 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-14 04:33:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8156 states to 8156 states and 13685 transitions. [2024-10-14 04:33:18,693 INFO L78 Accepts]: Start accepts. Automaton has 8156 states and 13685 transitions. Word has length 172 [2024-10-14 04:33:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:33:18,693 INFO L471 AbstractCegarLoop]: Abstraction has 8156 states and 13685 transitions. [2024-10-14 04:33:18,693 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-14 04:33:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 8156 states and 13685 transitions. [2024-10-14 04:33:18,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 04:33:18,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:33:18,698 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-14 04:33:18,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 04:33:18,699 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:33:18,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:33:18,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1653460788, now seen corresponding path program 1 times [2024-10-14 04:33:18,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:33:18,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669637227] [2024-10-14 04:33:18,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:33:18,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:33:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:18,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:33:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:18,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:33:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:18,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:33:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:18,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:33:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:18,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:33:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:18,895 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-14 04:33:18,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:33:18,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669637227] [2024-10-14 04:33:18,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669637227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:33:18,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:33:18,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:33:18,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189064226] [2024-10-14 04:33:18,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:33:18,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:33:18,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:33:18,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:33:18,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:33:18,897 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-14 04:33:22,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:33:22,447 INFO L93 Difference]: Finished difference Result 23615 states and 39019 transitions. [2024-10-14 04:33:22,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:33:22,448 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-14 04:33:22,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:33:22,489 INFO L225 Difference]: With dead ends: 23615 [2024-10-14 04:33:22,489 INFO L226 Difference]: Without dead ends: 17599 [2024-10-14 04:33:22,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:33:22,507 INFO L432 NwaCegarLoop]: 4461 mSDtfsCounter, 5552 mSDsluCounter, 17510 mSDsCounter, 0 mSdLazyCounter, 3783 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:33:22,507 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.2s Time] [2024-10-14 04:33:22,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17599 states. [2024-10-14 04:33:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17599 to 13872. [2024-10-14 04:33:23,096 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-14 04:33:23,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13872 states to 13872 states and 22943 transitions. [2024-10-14 04:33:23,126 INFO L78 Accepts]: Start accepts. Automaton has 13872 states and 22943 transitions. Word has length 172 [2024-10-14 04:33:23,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:33:23,126 INFO L471 AbstractCegarLoop]: Abstraction has 13872 states and 22943 transitions. [2024-10-14 04:33:23,127 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-14 04:33:23,127 INFO L276 IsEmpty]: Start isEmpty. Operand 13872 states and 22943 transitions. [2024-10-14 04:33:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 04:33:23,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:33:23,212 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-14 04:33:23,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 04:33:23,212 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:33:23,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:33:23,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1583812914, now seen corresponding path program 1 times [2024-10-14 04:33:23,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:33:23,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013341675] [2024-10-14 04:33:23,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:33:23,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:33:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:23,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:33:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:23,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:33:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:23,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:33:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:23,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:33:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:23,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:33:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:23,412 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-14 04:33:23,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:33:23,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013341675] [2024-10-14 04:33:23,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013341675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:33:23,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:33:23,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:33:23,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608393802] [2024-10-14 04:33:23,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:33:23,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:33:23,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:33:23,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:33:23,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:33:23,414 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-14 04:33:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:33:27,721 INFO L93 Difference]: Finished difference Result 49361 states and 81209 transitions. [2024-10-14 04:33:27,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:33:27,722 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-14 04:33:27,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:33:27,814 INFO L225 Difference]: With dead ends: 49361 [2024-10-14 04:33:27,815 INFO L226 Difference]: Without dead ends: 37629 [2024-10-14 04:33:27,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:33:27,855 INFO L432 NwaCegarLoop]: 4256 mSDtfsCounter, 6118 mSDsluCounter, 16945 mSDsCounter, 0 mSdLazyCounter, 3169 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:33:27,855 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.1s Time] [2024-10-14 04:33:27,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37629 states. [2024-10-14 04:33:29,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37629 to 25265. [2024-10-14 04:33:29,170 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-14 04:33:29,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25265 states to 25265 states and 41559 transitions. [2024-10-14 04:33:29,227 INFO L78 Accepts]: Start accepts. Automaton has 25265 states and 41559 transitions. Word has length 172 [2024-10-14 04:33:29,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:33:29,228 INFO L471 AbstractCegarLoop]: Abstraction has 25265 states and 41559 transitions. [2024-10-14 04:33:29,228 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-14 04:33:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 25265 states and 41559 transitions. [2024-10-14 04:33:29,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 04:33:29,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:33:29,240 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-14 04:33:29,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 04:33:29,240 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:33:29,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:33:29,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1165924212, now seen corresponding path program 1 times [2024-10-14 04:33:29,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:33:29,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32700297] [2024-10-14 04:33:29,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:33:29,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:33:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:29,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:33:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:29,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:33:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:29,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:33:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:29,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:33:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:29,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:33:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:29,539 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-14 04:33:29,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:33:29,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32700297] [2024-10-14 04:33:29,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32700297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:33:29,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:33:29,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:33:29,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499987690] [2024-10-14 04:33:29,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:33:29,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:33:29,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:33:29,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:33:29,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:33:29,542 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) [2024-10-14 04:33:36,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:33:36,328 INFO L93 Difference]: Finished difference Result 94704 states and 156191 transitions. [2024-10-14 04:33:36,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:33:36,329 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-14 04:33:36,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:33:36,551 INFO L225 Difference]: With dead ends: 94704 [2024-10-14 04:33:36,552 INFO L226 Difference]: Without dead ends: 71579 [2024-10-14 04:33:36,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:33:36,624 INFO L432 NwaCegarLoop]: 4458 mSDtfsCounter, 5659 mSDsluCounter, 17502 mSDsCounter, 0 mSdLazyCounter, 4479 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5678 SdHoareTripleChecker+Valid, 21960 SdHoareTripleChecker+Invalid, 4550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 4479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 04:33:36,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5678 Valid, 21960 Invalid, 4550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 4479 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 04:33:36,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71579 states. [2024-10-14 04:33:39,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71579 to 47538. [2024-10-14 04:33:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47538 states, 43917 states have (on average 1.6083065783181911) internal successors, (70632), 44048 states have internal predecessors, (70632), 2717 states have call successors, (2717), 775 states have call predecessors, (2717), 902 states have return successors, (5030), 2842 states have call predecessors, (5030), 2715 states have call successors, (5030) [2024-10-14 04:33:39,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47538 states to 47538 states and 78379 transitions. [2024-10-14 04:33:39,524 INFO L78 Accepts]: Start accepts. Automaton has 47538 states and 78379 transitions. Word has length 172 [2024-10-14 04:33:39,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:33:39,524 INFO L471 AbstractCegarLoop]: Abstraction has 47538 states and 78379 transitions. [2024-10-14 04:33:39,524 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-14 04:33:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 47538 states and 78379 transitions. [2024-10-14 04:33:39,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 04:33:39,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:33:39,543 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-14 04:33:39,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 04:33:39,543 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:33:39,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:33:39,543 INFO L85 PathProgramCache]: Analyzing trace with hash 233029390, now seen corresponding path program 1 times [2024-10-14 04:33:39,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:33:39,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545305867] [2024-10-14 04:33:39,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:33:39,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:33:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:39,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:33:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:39,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 04:33:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:39,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 04:33:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:39,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 04:33:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:39,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 04:33:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:33:39,734 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-14 04:33:39,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:33:39,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545305867] [2024-10-14 04:33:39,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545305867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:33:39,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:33:39,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:33:39,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590372760] [2024-10-14 04:33:39,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:33:39,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:33:39,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:33:39,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:33:39,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:33:39,735 INFO L87 Difference]: Start difference. First operand 47538 states and 78379 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-14 04:33:50,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:33:50,796 INFO L93 Difference]: Finished difference Result 182959 states and 303749 transitions. [2024-10-14 04:33:50,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:33:50,796 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-14 04:33:50,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:33:51,243 INFO L225 Difference]: With dead ends: 182959 [2024-10-14 04:33:51,243 INFO L226 Difference]: Without dead ends: 137561 [2024-10-14 04:33:51,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:33:51,548 INFO L432 NwaCegarLoop]: 4459 mSDtfsCounter, 5948 mSDsluCounter, 17505 mSDsCounter, 0 mSdLazyCounter, 3734 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5982 SdHoareTripleChecker+Valid, 21964 SdHoareTripleChecker+Invalid, 3806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 3734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 04:33:51,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5982 Valid, 21964 Invalid, 3806 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [72 Valid, 3734 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 04:33:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137561 states.