./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 38a1f42f3cb7a9f66fd0bd1b473ab60f2efbe0fc9c998d9f18da86c331297566 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:28:28,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:28:28,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:28:28,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:28:28,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:28:28,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:28:28,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:28:28,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:28:28,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:28:28,236 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:28:28,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:28:28,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:28:28,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:28:28,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:28:28,240 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:28:28,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:28:28,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:28:28,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:28:28,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:28:28,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:28:28,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:28:28,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:28:28,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:28:28,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:28:28,246 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:28:28,246 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:28:28,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:28:28,247 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:28:28,247 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:28:28,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:28:28,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:28:28,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:28:28,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:28:28,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:28:28,248 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:28:28,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:28:28,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:28:28,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:28:28,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:28:28,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:28:28,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:28:28,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:28:28,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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 38a1f42f3cb7a9f66fd0bd1b473ab60f2efbe0fc9c998d9f18da86c331297566 [2024-10-11 04:28:28,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:28:28,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:28:28,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:28:28,540 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:28:28,541 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:28:28,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c [2024-10-11 04:28:29,941 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:28:30,567 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:28:30,567 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c [2024-10-11 04:28:30,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a6b1d6d2b/f89f3b7acc7945209ba55e132cb73660/FLAG9ade8315e [2024-10-11 04:28:30,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a6b1d6d2b/f89f3b7acc7945209ba55e132cb73660 [2024-10-11 04:28:30,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:28:30,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:28:30,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:28:30,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:28:30,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:28:30,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:28:30" (1/1) ... [2024-10-11 04:28:30,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1260bc80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:28:30, skipping insertion in model container [2024-10-11 04:28:30,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:28:30" (1/1) ... [2024-10-11 04:28:30,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:28:32,618 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c[380593,380606] [2024-10-11 04:28:32,646 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c[383339,383352] [2024-10-11 04:28:32,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:28:32,936 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:28:33,761 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c[380593,380606] [2024-10-11 04:28:33,768 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.14.cil.c[383339,383352] [2024-10-11 04:28:33,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:28:33,848 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:28:33,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:28:33 WrapperNode [2024-10-11 04:28:33,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:28:33,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:28:33,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:28:33,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:28:33,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:28:33" (1/1) ... [2024-10-11 04:28:33,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:28:33" (1/1) ... [2024-10-11 04:28:34,350 INFO L138 Inliner]: procedures = 68, calls = 78, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 13237 [2024-10-11 04:28:34,351 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:28:34,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:28:34,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:28:34,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:28:34,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:28:33" (1/1) ... [2024-10-11 04:28:34,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:28:33" (1/1) ... [2024-10-11 04:28:34,408 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:28:33" (1/1) ... [2024-10-11 04:28:34,584 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-11 04:28:34,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:28:33" (1/1) ... [2024-10-11 04:28:34,585 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:28:33" (1/1) ... [2024-10-11 04:28:34,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:28:33" (1/1) ... [2024-10-11 04:28:35,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:28:33" (1/1) ... [2024-10-11 04:28:35,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:28:33" (1/1) ... [2024-10-11 04:28:35,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:28:33" (1/1) ... [2024-10-11 04:28:35,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:28:35,158 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:28:35,158 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:28:35,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:28:35,159 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:28:33" (1/1) ... [2024-10-11 04:28:35,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:28:35,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:28:35,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:28:35,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:28:35,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:28:35,237 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:28:35,237 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:28:35,237 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:28:35,238 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:28:35,238 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:28:35,239 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:28:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 04:28:35,239 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 04:28:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:28:35,239 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:28:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:28:35,240 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:28:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:28:35,240 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:28:35,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:28:35,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:28:35,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:28:35,399 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:28:35,401 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:28:43,335 INFO L? ?]: Removed 1759 outVars from TransFormulas that were not future-live. [2024-10-11 04:28:43,336 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:28:43,475 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:28:43,476 INFO L314 CfgBuilder]: Removed 16 assume(true) statements. [2024-10-11 04:28:43,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:28:43 BoogieIcfgContainer [2024-10-11 04:28:43,477 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:28:43,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:28:43,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:28:43,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:28:43,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:28:30" (1/3) ... [2024-10-11 04:28:43,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68113a53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:28:43, skipping insertion in model container [2024-10-11 04:28:43,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:28:33" (2/3) ... [2024-10-11 04:28:43,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68113a53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:28:43, skipping insertion in model container [2024-10-11 04:28:43,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:28:43" (3/3) ... [2024-10-11 04:28:43,488 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.14.cil.c [2024-10-11 04:28:43,505 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:28:43,505 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:28:43,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:28:43,643 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;@1c3af06d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:28:43,644 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:28:43,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 2477 states, 2439 states have (on average 1.8757687576875768) internal successors, (4575), 2444 states have internal predecessors, (4575), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 04:28:43,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:28:43,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:43,682 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:28:43,682 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:43,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:43,688 INFO L85 PathProgramCache]: Analyzing trace with hash -567169950, now seen corresponding path program 1 times [2024-10-11 04:28:43,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:43,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238944261] [2024-10-11 04:28:43,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:43,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:44,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:44,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:28:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:44,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:28:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:44,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:28:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:44,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:28:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:44,455 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-11 04:28:44,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:44,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238944261] [2024-10-11 04:28:44,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238944261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:44,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:44,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:28:44,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506628732] [2024-10-11 04:28:44,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:44,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:28:44,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:44,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:28:44,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:28:44,505 INFO L87 Difference]: Start difference. First operand has 2477 states, 2439 states have (on average 1.8757687576875768) internal successors, (4575), 2444 states have internal predecessors, (4575), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:28:46,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:46,788 INFO L93 Difference]: Finished difference Result 5079 states and 9486 transitions. [2024-10-11 04:28:46,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:28:46,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 162 [2024-10-11 04:28:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:46,819 INFO L225 Difference]: With dead ends: 5079 [2024-10-11 04:28:46,820 INFO L226 Difference]: Without dead ends: 2602 [2024-10-11 04:28:46,833 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-11 04:28:46,838 INFO L432 NwaCegarLoop]: 4264 mSDtfsCounter, 989 mSDsluCounter, 12214 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 16478 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:46,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 16478 Invalid, 1131 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:28:46,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2024-10-11 04:28:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2472. [2024-10-11 04:28:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 2436 states have (on average 1.8370279146141215) internal successors, (4475), 2439 states have internal predecessors, (4475), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 04:28:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 4529 transitions. [2024-10-11 04:28:46,991 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 4529 transitions. Word has length 162 [2024-10-11 04:28:46,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:46,992 INFO L471 AbstractCegarLoop]: Abstraction has 2472 states and 4529 transitions. [2024-10-11 04:28:46,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:28:46,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 4529 transitions. [2024-10-11 04:28:46,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:28:46,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:46,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:28:46,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:28:46,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:46,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:46,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1202301664, now seen corresponding path program 1 times [2024-10-11 04:28:46,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:46,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568327893] [2024-10-11 04:28:46,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:46,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:47,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:47,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:28:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:47,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:28:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:47,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:28:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:47,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:28:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:47,262 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-11 04:28:47,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:47,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568327893] [2024-10-11 04:28:47,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568327893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:47,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:47,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:28:47,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244140462] [2024-10-11 04:28:47,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:47,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:28:47,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:47,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:28:47,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:28:47,267 INFO L87 Difference]: Start difference. First operand 2472 states and 4529 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:28:49,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:49,290 INFO L93 Difference]: Finished difference Result 2940 states and 5310 transitions. [2024-10-11 04:28:49,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:28:49,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 162 [2024-10-11 04:28:49,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:49,304 INFO L225 Difference]: With dead ends: 2940 [2024-10-11 04:28:49,305 INFO L226 Difference]: Without dead ends: 2602 [2024-10-11 04:28:49,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:28:49,308 INFO L432 NwaCegarLoop]: 4260 mSDtfsCounter, 977 mSDsluCounter, 12205 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 16465 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:49,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 16465 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:28:49,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2024-10-11 04:28:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2472. [2024-10-11 04:28:49,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 2436 states have (on average 1.8366174055829227) internal successors, (4474), 2439 states have internal predecessors, (4474), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 04:28:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 4528 transitions. [2024-10-11 04:28:49,400 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 4528 transitions. Word has length 162 [2024-10-11 04:28:49,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:49,403 INFO L471 AbstractCegarLoop]: Abstraction has 2472 states and 4528 transitions. [2024-10-11 04:28:49,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:28:49,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 4528 transitions. [2024-10-11 04:28:49,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:28:49,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:49,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:28:49,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:28:49,412 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:49,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:49,412 INFO L85 PathProgramCache]: Analyzing trace with hash -728823970, now seen corresponding path program 1 times [2024-10-11 04:28:49,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:49,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090344444] [2024-10-11 04:28:49,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:49,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:49,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:49,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:28:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:49,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:28:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:49,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:28:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:49,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:28:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:49,730 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-11 04:28:49,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:49,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090344444] [2024-10-11 04:28:49,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090344444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:49,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:49,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:28:49,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888331739] [2024-10-11 04:28:49,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:49,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:28:49,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:49,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:28:49,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:28:49,733 INFO L87 Difference]: Start difference. First operand 2472 states and 4528 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:28:52,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:52,756 INFO L93 Difference]: Finished difference Result 3417 states and 6110 transitions. [2024-10-11 04:28:52,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:28:52,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 162 [2024-10-11 04:28:52,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:52,771 INFO L225 Difference]: With dead ends: 3417 [2024-10-11 04:28:52,771 INFO L226 Difference]: Without dead ends: 3084 [2024-10-11 04:28:52,774 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-11 04:28:52,778 INFO L432 NwaCegarLoop]: 4228 mSDtfsCounter, 5445 mSDsluCounter, 12677 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5464 SdHoareTripleChecker+Valid, 16905 SdHoareTripleChecker+Invalid, 2418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:52,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5464 Valid, 16905 Invalid, 2418 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [116 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 04:28:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2024-10-11 04:28:52,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 2823. [2024-10-11 04:28:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2823 states, 2759 states have (on average 1.8151504168176875) internal successors, (5008), 2763 states have internal predecessors, (5008), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-10-11 04:28:52,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 5107 transitions. [2024-10-11 04:28:52,876 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 5107 transitions. Word has length 162 [2024-10-11 04:28:52,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:52,877 INFO L471 AbstractCegarLoop]: Abstraction has 2823 states and 5107 transitions. [2024-10-11 04:28:52,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:28:52,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 5107 transitions. [2024-10-11 04:28:52,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:28:52,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:52,880 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:28:52,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:28:52,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:52,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:52,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1360774942, now seen corresponding path program 1 times [2024-10-11 04:28:52,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:52,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123051204] [2024-10-11 04:28:52,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:52,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:53,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:53,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:28:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:53,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:28:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:53,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:28:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:53,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:28:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:53,224 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-11 04:28:53,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:53,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123051204] [2024-10-11 04:28:53,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123051204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:53,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:53,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:53,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753663009] [2024-10-11 04:28:53,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:53,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:53,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:53,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:53,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:53,227 INFO L87 Difference]: Start difference. First operand 2823 states and 5107 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:28:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:28:57,204 INFO L93 Difference]: Finished difference Result 4268 states and 7528 transitions. [2024-10-11 04:28:57,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:28:57,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 162 [2024-10-11 04:28:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:28:57,224 INFO L225 Difference]: With dead ends: 4268 [2024-10-11 04:28:57,225 INFO L226 Difference]: Without dead ends: 3584 [2024-10-11 04:28:57,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:28:57,232 INFO L432 NwaCegarLoop]: 4433 mSDtfsCounter, 5480 mSDsluCounter, 17405 mSDsCounter, 0 mSdLazyCounter, 3740 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5499 SdHoareTripleChecker+Valid, 21838 SdHoareTripleChecker+Invalid, 3805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:28:57,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5499 Valid, 21838 Invalid, 3805 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3740 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 04:28:57,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2024-10-11 04:28:57,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 3147. [2024-10-11 04:28:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3147 states, 3055 states have (on average 1.7963993453355156) internal successors, (5488), 3060 states have internal predecessors, (5488), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-10-11 04:28:57,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3147 states to 3147 states and 5631 transitions. [2024-10-11 04:28:57,399 INFO L78 Accepts]: Start accepts. Automaton has 3147 states and 5631 transitions. Word has length 162 [2024-10-11 04:28:57,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:28:57,400 INFO L471 AbstractCegarLoop]: Abstraction has 3147 states and 5631 transitions. [2024-10-11 04:28:57,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:28:57,401 INFO L276 IsEmpty]: Start isEmpty. Operand 3147 states and 5631 transitions. [2024-10-11 04:28:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:28:57,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:28:57,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:28:57,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:28:57,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:28:57,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:28:57,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1771385308, now seen corresponding path program 1 times [2024-10-11 04:28:57,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:28:57,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416183240] [2024-10-11 04:28:57,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:28:57,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:28:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:57,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:28:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:57,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:28:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:57,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:28:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:57,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:28:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:57,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:28:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:28:57,788 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-11 04:28:57,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:28:57,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416183240] [2024-10-11 04:28:57,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416183240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:28:57,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:28:57,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:28:57,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061298271] [2024-10-11 04:28:57,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:28:57,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:28:57,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:28:57,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:28:57,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:28:57,793 INFO L87 Difference]: Start difference. First operand 3147 states and 5631 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:29:01,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:29:01,621 INFO L93 Difference]: Finished difference Result 5515 states and 9592 transitions. [2024-10-11 04:29:01,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:29:01,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 162 [2024-10-11 04:29:01,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:29:01,643 INFO L225 Difference]: With dead ends: 5515 [2024-10-11 04:29:01,643 INFO L226 Difference]: Without dead ends: 4507 [2024-10-11 04:29:01,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:29:01,650 INFO L432 NwaCegarLoop]: 4237 mSDtfsCounter, 5592 mSDsluCounter, 16878 mSDsCounter, 0 mSdLazyCounter, 3099 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5611 SdHoareTripleChecker+Valid, 21115 SdHoareTripleChecker+Invalid, 3206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:29:01,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5611 Valid, 21115 Invalid, 3206 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [107 Valid, 3099 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 04:29:01,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2024-10-11 04:29:01,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 3796. [2024-10-11 04:29:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3796 states, 3648 states have (on average 1.7678179824561404) internal successors, (6449), 3655 states have internal predecessors, (6449), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-11 04:29:01,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 6684 transitions. [2024-10-11 04:29:01,830 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 6684 transitions. Word has length 162 [2024-10-11 04:29:01,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:29:01,830 INFO L471 AbstractCegarLoop]: Abstraction has 3796 states and 6684 transitions. [2024-10-11 04:29:01,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:29:01,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 6684 transitions. [2024-10-11 04:29:01,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:29:01,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:29:01,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:29:01,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:29:01,834 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:29:01,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:29:01,835 INFO L85 PathProgramCache]: Analyzing trace with hash -16484514, now seen corresponding path program 1 times [2024-10-11 04:29:01,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:29:01,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441948110] [2024-10-11 04:29:01,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:29:01,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:29:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:01,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:29:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:02,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:29:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:02,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:29:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:02,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:29:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:02,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:29:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:02,184 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-11 04:29:02,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:29:02,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441948110] [2024-10-11 04:29:02,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441948110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:29:02,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:29:02,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:29:02,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674534633] [2024-10-11 04:29:02,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:29:02,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:29:02,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:29:02,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:29:02,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:29:02,187 INFO L87 Difference]: Start difference. First operand 3796 states and 6684 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:29:04,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:29:04,037 INFO L93 Difference]: Finished difference Result 6152 states and 10636 transitions. [2024-10-11 04:29:04,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:29:04,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 162 [2024-10-11 04:29:04,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:29:04,059 INFO L225 Difference]: With dead ends: 6152 [2024-10-11 04:29:04,059 INFO L226 Difference]: Without dead ends: 4495 [2024-10-11 04:29:04,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:29:04,069 INFO L432 NwaCegarLoop]: 4215 mSDtfsCounter, 5203 mSDsluCounter, 12497 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5223 SdHoareTripleChecker+Valid, 16712 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:29:04,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5223 Valid, 16712 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 04:29:04,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2024-10-11 04:29:04,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 3796. [2024-10-11 04:29:04,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3796 states, 3648 states have (on average 1.7664473684210527) internal successors, (6444), 3655 states have internal predecessors, (6444), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-11 04:29:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 6679 transitions. [2024-10-11 04:29:04,238 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 6679 transitions. Word has length 162 [2024-10-11 04:29:04,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:29:04,239 INFO L471 AbstractCegarLoop]: Abstraction has 3796 states and 6679 transitions. [2024-10-11 04:29:04,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:29:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 6679 transitions. [2024-10-11 04:29:04,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:29:04,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:29:04,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:29:04,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:29:04,243 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:29:04,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:29:04,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2142599580, now seen corresponding path program 1 times [2024-10-11 04:29:04,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:29:04,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069999709] [2024-10-11 04:29:04,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:29:04,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:29:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:04,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:29:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:04,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:29:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:04,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:29:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:04,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:29:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:04,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:29:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:04,534 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-11 04:29:04,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:29:04,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069999709] [2024-10-11 04:29:04,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069999709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:29:04,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:29:04,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:29:04,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577023949] [2024-10-11 04:29:04,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:29:04,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:29:04,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:29:04,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:29:04,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:29:04,538 INFO L87 Difference]: Start difference. First operand 3796 states and 6679 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:29:06,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:29:06,342 INFO L93 Difference]: Finished difference Result 6141 states and 10600 transitions. [2024-10-11 04:29:06,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:29:06,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 162 [2024-10-11 04:29:06,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:29:06,365 INFO L225 Difference]: With dead ends: 6141 [2024-10-11 04:29:06,368 INFO L226 Difference]: Without dead ends: 4484 [2024-10-11 04:29:06,380 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-11 04:29:06,380 INFO L432 NwaCegarLoop]: 4215 mSDtfsCounter, 5046 mSDsluCounter, 16621 mSDsCounter, 0 mSdLazyCounter, 1884 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5066 SdHoareTripleChecker+Valid, 20836 SdHoareTripleChecker+Invalid, 1953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:29:06,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5066 Valid, 20836 Invalid, 1953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1884 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 04:29:06,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4484 states. [2024-10-11 04:29:06,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4484 to 3796. [2024-10-11 04:29:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3796 states, 3648 states have (on average 1.765076754385965) internal successors, (6439), 3655 states have internal predecessors, (6439), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-11 04:29:06,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 6674 transitions. [2024-10-11 04:29:06,540 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 6674 transitions. Word has length 162 [2024-10-11 04:29:06,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:29:06,541 INFO L471 AbstractCegarLoop]: Abstraction has 3796 states and 6674 transitions. [2024-10-11 04:29:06,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:29:06,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 6674 transitions. [2024-10-11 04:29:06,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:29:06,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:29:06,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:29:06,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:29:06,545 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:29:06,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:29:06,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1734479014, now seen corresponding path program 1 times [2024-10-11 04:29:06,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:29:06,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163421368] [2024-10-11 04:29:06,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:29:06,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:29:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:06,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:29:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:06,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:29:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:06,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:29:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:06,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:29:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:06,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:29:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:06,844 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-11 04:29:06,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:29:06,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163421368] [2024-10-11 04:29:06,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163421368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:29:06,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:29:06,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:29:06,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014048455] [2024-10-11 04:29:06,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:29:06,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:29:06,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:29:06,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:29:06,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:29:06,847 INFO L87 Difference]: Start difference. First operand 3796 states and 6674 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:29:10,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:29:10,511 INFO L93 Difference]: Finished difference Result 7887 states and 13447 transitions. [2024-10-11 04:29:10,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:29:10,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 162 [2024-10-11 04:29:10,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:29:10,534 INFO L225 Difference]: With dead ends: 7887 [2024-10-11 04:29:10,535 INFO L226 Difference]: Without dead ends: 6230 [2024-10-11 04:29:10,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:29:10,543 INFO L432 NwaCegarLoop]: 4431 mSDtfsCounter, 5463 mSDsluCounter, 17405 mSDsCounter, 0 mSdLazyCounter, 3661 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5482 SdHoareTripleChecker+Valid, 21836 SdHoareTripleChecker+Invalid, 3728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:29:10,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5482 Valid, 21836 Invalid, 3728 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 3661 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 04:29:10,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6230 states. [2024-10-11 04:29:10,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6230 to 5109. [2024-10-11 04:29:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5109 states, 4849 states have (on average 1.7269540111363169) internal successors, (8374), 4860 states have internal predecessors, (8374), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-11 04:29:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5109 states to 5109 states and 8799 transitions. [2024-10-11 04:29:10,769 INFO L78 Accepts]: Start accepts. Automaton has 5109 states and 8799 transitions. Word has length 162 [2024-10-11 04:29:10,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:29:10,771 INFO L471 AbstractCegarLoop]: Abstraction has 5109 states and 8799 transitions. [2024-10-11 04:29:10,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:29:10,771 INFO L276 IsEmpty]: Start isEmpty. Operand 5109 states and 8799 transitions. [2024-10-11 04:29:10,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:29:10,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:29:10,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:29:10,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:29:10,775 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:29:10,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:29:10,776 INFO L85 PathProgramCache]: Analyzing trace with hash -335525412, now seen corresponding path program 1 times [2024-10-11 04:29:10,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:29:10,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333387547] [2024-10-11 04:29:10,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:29:10,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:29:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:10,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:29:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:10,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:29:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:11,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:29:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:11,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:29:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:11,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:29:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:11,042 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-11 04:29:11,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:29:11,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333387547] [2024-10-11 04:29:11,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333387547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:29:11,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:29:11,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:29:11,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439823626] [2024-10-11 04:29:11,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:29:11,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:29:11,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:29:11,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:29:11,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:29:11,045 INFO L87 Difference]: Start difference. First operand 5109 states and 8799 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:29:12,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:29:12,874 INFO L93 Difference]: Finished difference Result 9223 states and 15645 transitions. [2024-10-11 04:29:12,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:29:12,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 162 [2024-10-11 04:29:12,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:29:12,899 INFO L225 Difference]: With dead ends: 9223 [2024-10-11 04:29:12,899 INFO L226 Difference]: Without dead ends: 6253 [2024-10-11 04:29:12,910 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-11 04:29:12,911 INFO L432 NwaCegarLoop]: 4215 mSDtfsCounter, 5045 mSDsluCounter, 16621 mSDsCounter, 0 mSdLazyCounter, 1858 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5065 SdHoareTripleChecker+Valid, 20836 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:29:12,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5065 Valid, 20836 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1858 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:29:12,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6253 states. [2024-10-11 04:29:13,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6253 to 5109. [2024-10-11 04:29:13,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5109 states, 4849 states have (on average 1.7250979583419261) internal successors, (8365), 4860 states have internal predecessors, (8365), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-11 04:29:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5109 states to 5109 states and 8790 transitions. [2024-10-11 04:29:13,139 INFO L78 Accepts]: Start accepts. Automaton has 5109 states and 8790 transitions. Word has length 162 [2024-10-11 04:29:13,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:29:13,140 INFO L471 AbstractCegarLoop]: Abstraction has 5109 states and 8790 transitions. [2024-10-11 04:29:13,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:29:13,140 INFO L276 IsEmpty]: Start isEmpty. Operand 5109 states and 8790 transitions. [2024-10-11 04:29:13,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:29:13,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:29:13,145 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:29:13,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:29:13,145 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:29:13,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:29:13,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1952965862, now seen corresponding path program 1 times [2024-10-11 04:29:13,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:29:13,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994923891] [2024-10-11 04:29:13,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:29:13,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:29:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:13,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:29:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:13,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:29:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:13,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:29:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:13,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:29:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:13,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:29:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:29:13,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:29:13,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994923891] [2024-10-11 04:29:13,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994923891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:29:13,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:29:13,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:29:13,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357753497] [2024-10-11 04:29:13,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:29:13,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:29:13,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:29:13,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:29:13,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:29:13,424 INFO L87 Difference]: Start difference. First operand 5109 states and 8790 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:29:17,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:29:17,047 INFO L93 Difference]: Finished difference Result 12658 states and 21228 transitions. [2024-10-11 04:29:17,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:29:17,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 162 [2024-10-11 04:29:17,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:29:17,081 INFO L225 Difference]: With dead ends: 12658 [2024-10-11 04:29:17,081 INFO L226 Difference]: Without dead ends: 9688 [2024-10-11 04:29:17,093 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-11 04:29:17,094 INFO L432 NwaCegarLoop]: 4431 mSDtfsCounter, 5455 mSDsluCounter, 17405 mSDsCounter, 0 mSdLazyCounter, 3623 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5474 SdHoareTripleChecker+Valid, 21836 SdHoareTripleChecker+Invalid, 3690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:29:17,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5474 Valid, 21836 Invalid, 3690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3623 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 04:29:17,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9688 states. [2024-10-11 04:29:17,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9688 to 7745. [2024-10-11 04:29:17,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7745 states, 7261 states have (on average 1.6850296102465225) internal successors, (12235), 7280 states have internal predecessors, (12235), 364 states have call successors, (364), 103 states have call predecessors, (364), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-10-11 04:29:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7745 states to 7745 states and 13058 transitions. [2024-10-11 04:29:17,451 INFO L78 Accepts]: Start accepts. Automaton has 7745 states and 13058 transitions. Word has length 162 [2024-10-11 04:29:17,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:29:17,451 INFO L471 AbstractCegarLoop]: Abstraction has 7745 states and 13058 transitions. [2024-10-11 04:29:17,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:29:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 7745 states and 13058 transitions. [2024-10-11 04:29:17,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:29:17,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:29:17,457 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:29:17,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:29:17,458 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:29:17,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:29:17,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1589499364, now seen corresponding path program 1 times [2024-10-11 04:29:17,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:29:17,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926574382] [2024-10-11 04:29:17,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:29:17,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:29:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:17,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:29:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:17,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:29:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:17,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:29:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:17,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:29:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:17,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:29:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:17,711 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-11 04:29:17,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:29:17,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926574382] [2024-10-11 04:29:17,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926574382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:29:17,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:29:17,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:29:17,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120195331] [2024-10-11 04:29:17,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:29:17,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:29:17,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:29:17,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:29:17,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:29:17,714 INFO L87 Difference]: Start difference. First operand 7745 states and 13058 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:29:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:29:21,713 INFO L93 Difference]: Finished difference Result 22216 states and 36922 transitions. [2024-10-11 04:29:21,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:29:21,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 162 [2024-10-11 04:29:21,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:29:21,777 INFO L225 Difference]: With dead ends: 22216 [2024-10-11 04:29:21,777 INFO L226 Difference]: Without dead ends: 16610 [2024-10-11 04:29:21,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:29:21,804 INFO L432 NwaCegarLoop]: 4431 mSDtfsCounter, 5454 mSDsluCounter, 17405 mSDsCounter, 0 mSdLazyCounter, 3610 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5473 SdHoareTripleChecker+Valid, 21836 SdHoareTripleChecker+Invalid, 3677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:29:21,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5473 Valid, 21836 Invalid, 3677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3610 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 04:29:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16610 states. [2024-10-11 04:29:22,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16610 to 13030. [2024-10-11 04:29:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13030 states, 12098 states have (on average 1.652587204496611) internal successors, (19993), 12133 states have internal predecessors, (19993), 700 states have call successors, (700), 199 states have call predecessors, (700), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-10-11 04:29:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13030 states to 13030 states and 21666 transitions. [2024-10-11 04:29:22,585 INFO L78 Accepts]: Start accepts. Automaton has 13030 states and 21666 transitions. Word has length 162 [2024-10-11 04:29:22,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:29:22,585 INFO L471 AbstractCegarLoop]: Abstraction has 13030 states and 21666 transitions. [2024-10-11 04:29:22,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:29:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 13030 states and 21666 transitions. [2024-10-11 04:29:22,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:29:22,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:29:22,595 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:29:22,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:29:22,595 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:29:22,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:29:22,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1300679974, now seen corresponding path program 1 times [2024-10-11 04:29:22,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:29:22,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166388363] [2024-10-11 04:29:22,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:29:22,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:29:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:22,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:29:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:22,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:29:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:22,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:29:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:22,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:29:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:22,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:29:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:22,844 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-11 04:29:22,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:29:22,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166388363] [2024-10-11 04:29:22,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166388363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:29:22,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:29:22,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:29:22,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237203960] [2024-10-11 04:29:22,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:29:22,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:29:22,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:29:22,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:29:22,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:29:22,846 INFO L87 Difference]: Start difference. First operand 13030 states and 21666 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:29:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:29:27,175 INFO L93 Difference]: Finished difference Result 41331 states and 68500 transitions. [2024-10-11 04:29:27,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:29:27,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 162 [2024-10-11 04:29:27,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:29:27,293 INFO L225 Difference]: With dead ends: 41331 [2024-10-11 04:29:27,293 INFO L226 Difference]: Without dead ends: 30440 [2024-10-11 04:29:27,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:29:27,346 INFO L432 NwaCegarLoop]: 4237 mSDtfsCounter, 5553 mSDsluCounter, 16878 mSDsCounter, 0 mSdLazyCounter, 3005 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5572 SdHoareTripleChecker+Valid, 21115 SdHoareTripleChecker+Invalid, 3112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:29:27,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5572 Valid, 21115 Invalid, 3112 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [107 Valid, 3005 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 04:29:27,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30440 states. [2024-10-11 04:29:28,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30440 to 23631. [2024-10-11 04:29:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23631 states, 21803 states have (on average 1.6307388891436958) internal successors, (35555), 21870 states have internal predecessors, (35555), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-11 04:29:28,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23631 states to 23631 states and 39090 transitions. [2024-10-11 04:29:28,666 INFO L78 Accepts]: Start accepts. Automaton has 23631 states and 39090 transitions. Word has length 162 [2024-10-11 04:29:28,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:29:28,667 INFO L471 AbstractCegarLoop]: Abstraction has 23631 states and 39090 transitions. [2024-10-11 04:29:28,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:29:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 23631 states and 39090 transitions. [2024-10-11 04:29:28,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:29:28,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:29:28,683 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:29:28,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:29:28,684 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:29:28,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:29:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1845552548, now seen corresponding path program 1 times [2024-10-11 04:29:28,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:29:28,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148949996] [2024-10-11 04:29:28,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:29:28,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:29:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:28,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:29:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:28,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:29:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:28,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:29:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:28,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:29:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:28,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:29:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:28,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:29:28,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:29:28,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148949996] [2024-10-11 04:29:28,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148949996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:29:28,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:29:28,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:29:28,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345176104] [2024-10-11 04:29:28,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:29:28,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:29:28,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:29:28,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:29:28,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:29:28,937 INFO L87 Difference]: Start difference. First operand 23631 states and 39090 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:29:31,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:29:31,681 INFO L93 Difference]: Finished difference Result 52363 states and 87432 transitions. [2024-10-11 04:29:31,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:29:31,681 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 162 [2024-10-11 04:29:31,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:29:31,792 INFO L225 Difference]: With dead ends: 52363 [2024-10-11 04:29:31,793 INFO L226 Difference]: Without dead ends: 30871 [2024-10-11 04:29:31,846 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-11 04:29:31,847 INFO L432 NwaCegarLoop]: 4215 mSDtfsCounter, 5205 mSDsluCounter, 12497 mSDsCounter, 0 mSdLazyCounter, 1636 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5225 SdHoareTripleChecker+Valid, 16712 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:29:31,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5225 Valid, 16712 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1636 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:29:31,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30871 states. [2024-10-11 04:29:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30871 to 23631. [2024-10-11 04:29:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23631 states, 21803 states have (on average 1.6277576480300877) internal successors, (35490), 21870 states have internal predecessors, (35490), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-11 04:29:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23631 states to 23631 states and 39025 transitions. [2024-10-11 04:29:33,291 INFO L78 Accepts]: Start accepts. Automaton has 23631 states and 39025 transitions. Word has length 162 [2024-10-11 04:29:33,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:29:33,291 INFO L471 AbstractCegarLoop]: Abstraction has 23631 states and 39025 transitions. [2024-10-11 04:29:33,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:29:33,291 INFO L276 IsEmpty]: Start isEmpty. Operand 23631 states and 39025 transitions. [2024-10-11 04:29:33,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 04:29:33,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:29:33,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:29:33,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:29:33,309 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:29:33,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:29:33,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1170392422, now seen corresponding path program 1 times [2024-10-11 04:29:33,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:29:33,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882843308] [2024-10-11 04:29:33,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:29:33,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:29:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:33,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:29:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:33,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 04:29:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:33,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 04:29:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:33,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 04:29:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:33,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 04:29:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:29:33,627 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-11 04:29:33,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:29:33,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882843308] [2024-10-11 04:29:33,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882843308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:29:33,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:29:33,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:29:33,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689738546] [2024-10-11 04:29:33,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:29:33,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:29:33,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:29:33,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:29:33,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:29:33,631 INFO L87 Difference]: Start difference. First operand 23631 states and 39025 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:29:39,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:29:39,816 INFO L93 Difference]: Finished difference Result 89158 states and 147480 transitions. [2024-10-11 04:29:39,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:29:39,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 162 [2024-10-11 04:29:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:29:40,078 INFO L225 Difference]: With dead ends: 89158 [2024-10-11 04:29:40,078 INFO L226 Difference]: Without dead ends: 67666 [2024-10-11 04:29:40,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:29:40,158 INFO L432 NwaCegarLoop]: 4429 mSDtfsCounter, 5881 mSDsluCounter, 17400 mSDsCounter, 0 mSdLazyCounter, 3530 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5913 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 3600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 3530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:29:40,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5913 Valid, 21829 Invalid, 3600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 3530 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 04:29:40,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67666 states.