./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_label42+token_ring.08.cil-2.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_label42+token_ring.08.cil-2.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 9803c0f5a18eedfb3ad16cce49537bdc49a8790d5c61a825350a143730d73381 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:14:13,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:14:13,405 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:14:13,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:14:13,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:14:13,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:14:13,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:14:13,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:14:13,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:14:13,449 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:14:13,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:14:13,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:14:13,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:14:13,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:14:13,451 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:14:13,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:14:13,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:14:13,452 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:14:13,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:14:13,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:14:13,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:14:13,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:14:13,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:14:13,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:14:13,457 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:14:13,457 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:14:13,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:14:13,457 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:14:13,458 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:14:13,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:14:13,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:14:13,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:14:13,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:14:13,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:14:13,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:14:13,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:14:13,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:14:13,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:14:13,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:14:13,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:14:13,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:14:13,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:14:13,462 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 -> 9803c0f5a18eedfb3ad16cce49537bdc49a8790d5c61a825350a143730d73381 [2024-10-11 04:14:13,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:14:13,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:14:13,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:14:13,761 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:14:13,762 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:14:13,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.08.cil-2.c [2024-10-11 04:14:15,194 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:14:15,860 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:14:15,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.08.cil-2.c [2024-10-11 04:14:15,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2304248a8/dcefeb9ab6ed4637948a699e752dbe30/FLAGa91db2320 [2024-10-11 04:14:15,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2304248a8/dcefeb9ab6ed4637948a699e752dbe30 [2024-10-11 04:14:15,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:14:15,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:14:15,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:14:15,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:14:15,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:14:15,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:14:15" (1/1) ... [2024-10-11 04:14:15,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14d0b972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:15, skipping insertion in model container [2024-10-11 04:14:15,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:14:15" (1/1) ... [2024-10-11 04:14:16,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:14:17,782 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_label42+token_ring.08.cil-2.c[378560,378573] [2024-10-11 04:14:17,815 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_label42+token_ring.08.cil-2.c[383339,383352] [2024-10-11 04:14:18,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:14:18,073 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:14:18,821 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_label42+token_ring.08.cil-2.c[378560,378573] [2024-10-11 04:14:18,829 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_label42+token_ring.08.cil-2.c[383339,383352] [2024-10-11 04:14:18,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:14:18,951 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:14:18,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:18 WrapperNode [2024-10-11 04:14:18,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:14:18,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:14:18,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:14:18,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:14:18,961 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:14:18" (1/1) ... [2024-10-11 04:14:19,059 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:14:18" (1/1) ... [2024-10-11 04:14:19,580 INFO L138 Inliner]: procedures = 60, calls = 66, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 12999 [2024-10-11 04:14:19,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:14:19,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:14:19,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:14:19,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:14:19,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:18" (1/1) ... [2024-10-11 04:14:19,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:18" (1/1) ... [2024-10-11 04:14:19,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:18" (1/1) ... [2024-10-11 04:14:19,836 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:14:19,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:18" (1/1) ... [2024-10-11 04:14:19,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:18" (1/1) ... [2024-10-11 04:14:20,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:18" (1/1) ... [2024-10-11 04:14:20,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:18" (1/1) ... [2024-10-11 04:14:20,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:18" (1/1) ... [2024-10-11 04:14:20,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:18" (1/1) ... [2024-10-11 04:14:20,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:14:20,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:14:20,279 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:14:20,279 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:14:20,280 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:18" (1/1) ... [2024-10-11 04:14:20,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:14:20,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:14:20,313 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:14:20,316 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:14:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:14:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:14:20,368 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:14:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:14:20,370 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:14:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:14:20,370 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:14:20,370 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 04:14:20,370 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 04:14:20,371 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:14:20,371 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:14:20,371 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:14:20,371 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:14:20,371 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:14:20,372 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:14:20,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:14:20,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:14:20,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:14:20,513 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:14:20,515 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:14:28,396 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2024-10-11 04:14:28,396 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:14:28,519 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:14:28,520 INFO L314 CfgBuilder]: Removed 12 assume(true) statements. [2024-10-11 04:14:28,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:14:28 BoogieIcfgContainer [2024-10-11 04:14:28,521 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:14:28,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:14:28,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:14:28,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:14:28,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:14:15" (1/3) ... [2024-10-11 04:14:28,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3c75ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:14:28, skipping insertion in model container [2024-10-11 04:14:28,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:14:18" (2/3) ... [2024-10-11 04:14:28,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3c75ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:14:28, skipping insertion in model container [2024-10-11 04:14:28,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:14:28" (3/3) ... [2024-10-11 04:14:28,530 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.08.cil-2.c [2024-10-11 04:14:28,548 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:14:28,549 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:14:28,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:14:28,678 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;@13a913a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:14:28,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:14:28,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 2387 states, 2353 states have (on average 1.87972800679983) internal successors, (4423), 2358 states have internal predecessors, (4423), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 04:14:28,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 04:14:28,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:28,718 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] [2024-10-11 04:14:28,719 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:28,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:28,724 INFO L85 PathProgramCache]: Analyzing trace with hash -344256000, now seen corresponding path program 1 times [2024-10-11 04:14:28,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:28,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559978704] [2024-10-11 04:14:28,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:28,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:29,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:29,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:14:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:29,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:14:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:29,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:14:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:29,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:14:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:29,313 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:14:29,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:29,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559978704] [2024-10-11 04:14:29,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559978704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:29,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:29,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:14:29,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9964199] [2024-10-11 04:14:29,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:29,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:14:29,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:29,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:14:29,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:14:29,365 INFO L87 Difference]: Start difference. First operand has 2387 states, 2353 states have (on average 1.87972800679983) internal successors, (4423), 2358 states have internal predecessors, (4423), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 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:14:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:30,884 INFO L93 Difference]: Finished difference Result 4859 states and 9094 transitions. [2024-10-11 04:14:30,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:14:30,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 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 122 [2024-10-11 04:14:30,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:30,925 INFO L225 Difference]: With dead ends: 4859 [2024-10-11 04:14:30,926 INFO L226 Difference]: Without dead ends: 2472 [2024-10-11 04:14:30,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:14:30,941 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 709 mSDsluCounter, 12134 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 16326 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:30,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 16326 Invalid, 811 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [52 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:14:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2024-10-11 04:14:31,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2382. [2024-10-11 04:14:31,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2350 states have (on average 1.8429787234042554) internal successors, (4331), 2353 states have internal predecessors, (4331), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 04:14:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 4377 transitions. [2024-10-11 04:14:31,139 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 4377 transitions. Word has length 122 [2024-10-11 04:14:31,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:31,140 INFO L471 AbstractCegarLoop]: Abstraction has 2382 states and 4377 transitions. [2024-10-11 04:14:31,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 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:14:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 4377 transitions. [2024-10-11 04:14:31,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 04:14:31,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:31,150 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] [2024-10-11 04:14:31,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:14:31,151 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:31,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:31,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2021779070, now seen corresponding path program 1 times [2024-10-11 04:14:31,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:31,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253529954] [2024-10-11 04:14:31,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:31,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:31,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:31,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:14:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:31,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:14:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:31,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:14:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:31,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:14:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:31,546 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:14:31,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:31,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253529954] [2024-10-11 04:14:31,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253529954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:31,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:31,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:14:31,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064800058] [2024-10-11 04:14:31,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:31,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:14:31,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:31,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:14:31,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:14:31,554 INFO L87 Difference]: Start difference. First operand 2382 states and 4377 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 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:14:33,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:33,798 INFO L93 Difference]: Finished difference Result 3067 states and 5511 transitions. [2024-10-11 04:14:33,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:14:33,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 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 122 [2024-10-11 04:14:33,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:33,815 INFO L225 Difference]: With dead ends: 3067 [2024-10-11 04:14:33,815 INFO L226 Difference]: Without dead ends: 2820 [2024-10-11 04:14:33,819 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:14:33,820 INFO L432 NwaCegarLoop]: 4165 mSDtfsCounter, 5014 mSDsluCounter, 12483 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5029 SdHoareTripleChecker+Valid, 16648 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:33,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5029 Valid, 16648 Invalid, 1727 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [100 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 04:14:33,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2024-10-11 04:14:33,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2639. [2024-10-11 04:14:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2639 states, 2583 states have (on average 1.8246225319396052) internal successors, (4713), 2587 states have internal predecessors, (4713), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-10-11 04:14:33,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 4796 transitions. [2024-10-11 04:14:33,913 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 4796 transitions. Word has length 122 [2024-10-11 04:14:33,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:33,913 INFO L471 AbstractCegarLoop]: Abstraction has 2639 states and 4796 transitions. [2024-10-11 04:14:33,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 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:14:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 4796 transitions. [2024-10-11 04:14:33,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 04:14:33,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:33,917 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] [2024-10-11 04:14:33,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:14:33,918 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:33,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:33,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1745853758, now seen corresponding path program 1 times [2024-10-11 04:14:33,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:33,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917543346] [2024-10-11 04:14:33,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:33,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:34,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:34,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:14:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:34,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:14:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:34,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:14:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:34,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:14:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:34,237 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:14:34,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:34,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917543346] [2024-10-11 04:14:34,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917543346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:34,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:34,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:34,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086537438] [2024-10-11 04:14:34,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:34,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:34,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:34,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:34,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:34,240 INFO L87 Difference]: Start difference. First operand 2639 states and 4796 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:14:37,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:37,213 INFO L93 Difference]: Finished difference Result 3682 states and 6521 transitions. [2024-10-11 04:14:37,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:14:37,214 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-11 04:14:37,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:37,232 INFO L225 Difference]: With dead ends: 3682 [2024-10-11 04:14:37,232 INFO L226 Difference]: Without dead ends: 3178 [2024-10-11 04:14:37,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:14:37,241 INFO L432 NwaCegarLoop]: 4322 mSDtfsCounter, 5033 mSDsluCounter, 17024 mSDsCounter, 0 mSdLazyCounter, 2653 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5048 SdHoareTripleChecker+Valid, 21346 SdHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:37,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5048 Valid, 21346 Invalid, 2710 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 2653 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 04:14:37,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2024-10-11 04:14:37,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 2877. [2024-10-11 04:14:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2877 states, 2797 states have (on average 1.8080085806220951) internal successors, (5057), 2802 states have internal predecessors, (5057), 58 states have call successors, (58), 19 states have call predecessors, (58), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-10-11 04:14:37,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2877 states and 5176 transitions. [2024-10-11 04:14:37,350 INFO L78 Accepts]: Start accepts. Automaton has 2877 states and 5176 transitions. Word has length 122 [2024-10-11 04:14:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:37,350 INFO L471 AbstractCegarLoop]: Abstraction has 2877 states and 5176 transitions. [2024-10-11 04:14:37,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:14:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2877 states and 5176 transitions. [2024-10-11 04:14:37,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 04:14:37,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:37,354 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] [2024-10-11 04:14:37,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:14:37,355 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:37,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:37,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1159819524, now seen corresponding path program 1 times [2024-10-11 04:14:37,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:37,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302978228] [2024-10-11 04:14:37,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:37,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:37,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:37,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:14:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:37,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:14:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:37,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:14:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:37,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:14:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:37,624 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:14:37,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:37,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302978228] [2024-10-11 04:14:37,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302978228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:37,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:37,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:37,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643722453] [2024-10-11 04:14:37,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:37,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:37,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:37,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:37,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:37,629 INFO L87 Difference]: Start difference. First operand 2877 states and 5176 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:14:39,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:39,906 INFO L93 Difference]: Finished difference Result 4583 states and 7993 transitions. [2024-10-11 04:14:39,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:14:39,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-11 04:14:39,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:39,926 INFO L225 Difference]: With dead ends: 4583 [2024-10-11 04:14:39,926 INFO L226 Difference]: Without dead ends: 3841 [2024-10-11 04:14:39,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:14:39,932 INFO L432 NwaCegarLoop]: 4174 mSDtfsCounter, 5113 mSDsluCounter, 16625 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5128 SdHoareTripleChecker+Valid, 20799 SdHoareTripleChecker+Invalid, 2287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:39,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5128 Valid, 20799 Invalid, 2287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:14:39,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2024-10-11 04:14:40,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3354. [2024-10-11 04:14:40,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3354 states, 3226 states have (on average 1.7811531308121513) internal successors, (5746), 3233 states have internal predecessors, (5746), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-11 04:14:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 5941 transitions. [2024-10-11 04:14:40,083 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 5941 transitions. Word has length 122 [2024-10-11 04:14:40,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:40,083 INFO L471 AbstractCegarLoop]: Abstraction has 3354 states and 5941 transitions. [2024-10-11 04:14:40,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:14:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 5941 transitions. [2024-10-11 04:14:40,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 04:14:40,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:40,086 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] [2024-10-11 04:14:40,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:14:40,086 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:40,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:40,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1101753726, now seen corresponding path program 1 times [2024-10-11 04:14:40,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:40,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096421830] [2024-10-11 04:14:40,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:40,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:40,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:40,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:14:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:40,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:14:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:40,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:14:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:40,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:14:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:40,284 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:14:40,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:40,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096421830] [2024-10-11 04:14:40,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096421830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:40,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:40,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:40,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419318455] [2024-10-11 04:14:40,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:40,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:40,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:40,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:40,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:40,293 INFO L87 Difference]: Start difference. First operand 3354 states and 5941 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:14:41,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:41,706 INFO L93 Difference]: Finished difference Result 5048 states and 8749 transitions. [2024-10-11 04:14:41,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:14:41,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-11 04:14:41,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:41,726 INFO L225 Difference]: With dead ends: 5048 [2024-10-11 04:14:41,727 INFO L226 Difference]: Without dead ends: 3829 [2024-10-11 04:14:41,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:14:41,734 INFO L432 NwaCegarLoop]: 4152 mSDtfsCounter, 4742 mSDsluCounter, 16424 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4758 SdHoareTripleChecker+Valid, 20576 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:41,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4758 Valid, 20576 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:14:41,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3829 states. [2024-10-11 04:14:41,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3829 to 3354. [2024-10-11 04:14:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3354 states, 3226 states have (on average 1.7796032238065715) internal successors, (5741), 3233 states have internal predecessors, (5741), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-11 04:14:41,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 5936 transitions. [2024-10-11 04:14:41,974 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 5936 transitions. Word has length 122 [2024-10-11 04:14:41,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:41,975 INFO L471 AbstractCegarLoop]: Abstraction has 3354 states and 5936 transitions. [2024-10-11 04:14:41,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:14:41,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 5936 transitions. [2024-10-11 04:14:41,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 04:14:41,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:41,978 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] [2024-10-11 04:14:41,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:14:41,979 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:41,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:41,980 INFO L85 PathProgramCache]: Analyzing trace with hash -764954948, now seen corresponding path program 1 times [2024-10-11 04:14:41,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:41,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725528240] [2024-10-11 04:14:41,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:41,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:42,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:42,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:14:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:42,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:14:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:42,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:14:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:42,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:14:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:42,204 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:14:42,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:42,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725528240] [2024-10-11 04:14:42,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725528240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:42,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:42,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:42,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92690801] [2024-10-11 04:14:42,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:42,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:42,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:42,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:42,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:42,208 INFO L87 Difference]: Start difference. First operand 3354 states and 5936 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:14:43,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:43,419 INFO L93 Difference]: Finished difference Result 5037 states and 8713 transitions. [2024-10-11 04:14:43,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:14:43,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-11 04:14:43,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:43,439 INFO L225 Difference]: With dead ends: 5037 [2024-10-11 04:14:43,439 INFO L226 Difference]: Without dead ends: 3818 [2024-10-11 04:14:43,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:14:43,447 INFO L432 NwaCegarLoop]: 4152 mSDtfsCounter, 4848 mSDsluCounter, 12339 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4864 SdHoareTripleChecker+Valid, 16491 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:43,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4864 Valid, 16491 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:14:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3818 states. [2024-10-11 04:14:43,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3818 to 3354. [2024-10-11 04:14:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3354 states, 3226 states have (on average 1.778053316800992) internal successors, (5736), 3233 states have internal predecessors, (5736), 92 states have call successors, (92), 31 states have call predecessors, (92), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-11 04:14:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 5931 transitions. [2024-10-11 04:14:43,620 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 5931 transitions. Word has length 122 [2024-10-11 04:14:43,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:43,620 INFO L471 AbstractCegarLoop]: Abstraction has 3354 states and 5931 transitions. [2024-10-11 04:14:43,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:14:43,621 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 5931 transitions. [2024-10-11 04:14:43,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 04:14:43,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:43,623 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] [2024-10-11 04:14:43,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:14:43,624 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:43,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:43,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1132541818, now seen corresponding path program 1 times [2024-10-11 04:14:43,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:43,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42375893] [2024-10-11 04:14:43,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:43,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:43,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:43,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:14:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:43,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:14:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:43,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:14:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:43,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:14:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:43,856 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:14:43,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:43,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42375893] [2024-10-11 04:14:43,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42375893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:43,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:43,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:43,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476044886] [2024-10-11 04:14:43,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:43,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:43,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:43,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:43,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:43,860 INFO L87 Difference]: Start difference. First operand 3354 states and 5931 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:14:46,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:46,280 INFO L93 Difference]: Finished difference Result 6295 states and 10728 transitions. [2024-10-11 04:14:46,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:14:46,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-11 04:14:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:46,318 INFO L225 Difference]: With dead ends: 6295 [2024-10-11 04:14:46,322 INFO L226 Difference]: Without dead ends: 5076 [2024-10-11 04:14:46,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:14:46,331 INFO L432 NwaCegarLoop]: 4320 mSDtfsCounter, 5016 mSDsluCounter, 17024 mSDsCounter, 0 mSdLazyCounter, 2574 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5031 SdHoareTripleChecker+Valid, 21344 SdHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:46,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5031 Valid, 21344 Invalid, 2633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2574 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 04:14:46,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5076 states. [2024-10-11 04:14:46,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5076 to 4323. [2024-10-11 04:14:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4323 states, 4099 states have (on average 1.738716760185411) internal successors, (7127), 4110 states have internal predecessors, (7127), 160 states have call successors, (160), 55 states have call predecessors, (160), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-11 04:14:46,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4323 states to 4323 states and 7480 transitions. [2024-10-11 04:14:46,519 INFO L78 Accepts]: Start accepts. Automaton has 4323 states and 7480 transitions. Word has length 122 [2024-10-11 04:14:46,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:46,520 INFO L471 AbstractCegarLoop]: Abstraction has 4323 states and 7480 transitions. [2024-10-11 04:14:46,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:14:46,521 INFO L276 IsEmpty]: Start isEmpty. Operand 4323 states and 7480 transitions. [2024-10-11 04:14:46,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 04:14:46,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:46,524 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] [2024-10-11 04:14:46,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:14:46,524 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:46,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:46,525 INFO L85 PathProgramCache]: Analyzing trace with hash -2131384580, now seen corresponding path program 1 times [2024-10-11 04:14:46,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:46,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078963200] [2024-10-11 04:14:46,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:46,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:46,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:46,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:14:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:46,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:14:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:46,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:14:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:46,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:14:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:46,728 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:14:46,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:46,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078963200] [2024-10-11 04:14:46,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078963200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:46,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:46,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:46,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758093773] [2024-10-11 04:14:46,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:46,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:46,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:46,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:46,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:46,730 INFO L87 Difference]: Start difference. First operand 4323 states and 7480 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:14:48,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:48,072 INFO L93 Difference]: Finished difference Result 7271 states and 12318 transitions. [2024-10-11 04:14:48,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:14:48,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-11 04:14:48,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:48,092 INFO L225 Difference]: With dead ends: 7271 [2024-10-11 04:14:48,092 INFO L226 Difference]: Without dead ends: 5083 [2024-10-11 04:14:48,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:14:48,102 INFO L432 NwaCegarLoop]: 4152 mSDtfsCounter, 4738 mSDsluCounter, 16424 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4754 SdHoareTripleChecker+Valid, 20576 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:48,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4754 Valid, 20576 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:14:48,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5083 states. [2024-10-11 04:14:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5083 to 4323. [2024-10-11 04:14:48,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4323 states, 4099 states have (on average 1.7365211027079777) internal successors, (7118), 4110 states have internal predecessors, (7118), 160 states have call successors, (160), 55 states have call predecessors, (160), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-11 04:14:48,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4323 states to 4323 states and 7471 transitions. [2024-10-11 04:14:48,297 INFO L78 Accepts]: Start accepts. Automaton has 4323 states and 7471 transitions. Word has length 122 [2024-10-11 04:14:48,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:48,297 INFO L471 AbstractCegarLoop]: Abstraction has 4323 states and 7471 transitions. [2024-10-11 04:14:48,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:14:48,298 INFO L276 IsEmpty]: Start isEmpty. Operand 4323 states and 7471 transitions. [2024-10-11 04:14:48,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 04:14:48,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:48,301 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] [2024-10-11 04:14:48,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:14:48,302 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:48,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:48,303 INFO L85 PathProgramCache]: Analyzing trace with hash 257179450, now seen corresponding path program 1 times [2024-10-11 04:14:48,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:48,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561178909] [2024-10-11 04:14:48,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:48,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:48,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:48,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:14:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:48,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:14:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:48,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:14:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:48,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:14:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:48,527 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:14:48,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:48,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561178909] [2024-10-11 04:14:48,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561178909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:48,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:48,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:48,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561446135] [2024-10-11 04:14:48,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:48,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:48,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:48,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:48,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:48,531 INFO L87 Difference]: Start difference. First operand 4323 states and 7471 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:14:50,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:50,912 INFO L93 Difference]: Finished difference Result 9746 states and 16269 transitions. [2024-10-11 04:14:50,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:14:50,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-11 04:14:50,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:50,940 INFO L225 Difference]: With dead ends: 9746 [2024-10-11 04:14:50,940 INFO L226 Difference]: Without dead ends: 7558 [2024-10-11 04:14:50,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:14:50,951 INFO L432 NwaCegarLoop]: 4320 mSDtfsCounter, 5008 mSDsluCounter, 17024 mSDsCounter, 0 mSdLazyCounter, 2536 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5023 SdHoareTripleChecker+Valid, 21344 SdHoareTripleChecker+Invalid, 2595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:50,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5023 Valid, 21344 Invalid, 2595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2536 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 04:14:50,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2024-10-11 04:14:51,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 6271. [2024-10-11 04:14:51,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6271 states, 5855 states have (on average 1.690862510674637) internal successors, (9900), 5874 states have internal predecessors, (9900), 296 states have call successors, (296), 103 states have call predecessors, (296), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-10-11 04:14:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6271 states to 6271 states and 10587 transitions. [2024-10-11 04:14:51,260 INFO L78 Accepts]: Start accepts. Automaton has 6271 states and 10587 transitions. Word has length 122 [2024-10-11 04:14:51,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:51,262 INFO L471 AbstractCegarLoop]: Abstraction has 6271 states and 10587 transitions. [2024-10-11 04:14:51,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:14:51,263 INFO L276 IsEmpty]: Start isEmpty. Operand 6271 states and 10587 transitions. [2024-10-11 04:14:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 04:14:51,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:51,268 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] [2024-10-11 04:14:51,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:14:51,268 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:51,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1858250556, now seen corresponding path program 1 times [2024-10-11 04:14:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:51,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474361171] [2024-10-11 04:14:51,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:51,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:51,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:51,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:14:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:51,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:14:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:51,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:14:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:51,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:14:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:51,476 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:14:51,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:51,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474361171] [2024-10-11 04:14:51,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474361171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:51,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:51,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:51,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620285792] [2024-10-11 04:14:51,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:51,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:51,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:51,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:51,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:51,478 INFO L87 Difference]: Start difference. First operand 6271 states and 10587 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:14:54,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:54,275 INFO L93 Difference]: Finished difference Result 18328 states and 30157 transitions. [2024-10-11 04:14:54,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:14:54,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-11 04:14:54,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:54,331 INFO L225 Difference]: With dead ends: 18328 [2024-10-11 04:14:54,332 INFO L226 Difference]: Without dead ends: 14192 [2024-10-11 04:14:54,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:14:54,353 INFO L432 NwaCegarLoop]: 4318 mSDtfsCounter, 5301 mSDsluCounter, 17019 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5325 SdHoareTripleChecker+Valid, 21337 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:54,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5325 Valid, 21337 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2513 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 04:14:54,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14192 states. [2024-10-11 04:14:55,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14192 to 10148. [2024-10-11 04:14:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10148 states, 9364 states have (on average 1.6516445963263562) internal successors, (15466), 9399 states have internal predecessors, (15466), 552 states have call successors, (552), 199 states have call predecessors, (552), 230 states have return successors, (825), 581 states have call predecessors, (825), 550 states have call successors, (825) [2024-10-11 04:14:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10148 states to 10148 states and 16843 transitions. [2024-10-11 04:14:55,213 INFO L78 Accepts]: Start accepts. Automaton has 10148 states and 16843 transitions. Word has length 122 [2024-10-11 04:14:55,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:55,214 INFO L471 AbstractCegarLoop]: Abstraction has 10148 states and 16843 transitions. [2024-10-11 04:14:55,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:14:55,214 INFO L276 IsEmpty]: Start isEmpty. Operand 10148 states and 16843 transitions. [2024-10-11 04:14:55,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 04:14:55,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:55,227 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] [2024-10-11 04:14:55,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:14:55,227 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:55,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:55,228 INFO L85 PathProgramCache]: Analyzing trace with hash 801519354, now seen corresponding path program 1 times [2024-10-11 04:14:55,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:55,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542353712] [2024-10-11 04:14:55,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:55,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:55,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:55,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:14:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:55,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:14:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:55,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:14:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:55,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:14:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:55,467 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:14:55,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:55,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542353712] [2024-10-11 04:14:55,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542353712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:55,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:55,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:55,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631069950] [2024-10-11 04:14:55,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:55,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:55,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:55,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:55,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:55,469 INFO L87 Difference]: Start difference. First operand 10148 states and 16843 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:14:59,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:59,030 INFO L93 Difference]: Finished difference Result 33379 states and 54727 transitions. [2024-10-11 04:14:59,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:14:59,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-11 04:14:59,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:59,128 INFO L225 Difference]: With dead ends: 33379 [2024-10-11 04:14:59,128 INFO L226 Difference]: Without dead ends: 25366 [2024-10-11 04:14:59,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:14:59,165 INFO L432 NwaCegarLoop]: 4200 mSDtfsCounter, 5136 mSDsluCounter, 16647 mSDsCounter, 0 mSdLazyCounter, 2644 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5150 SdHoareTripleChecker+Valid, 20847 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:59,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5150 Valid, 20847 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2644 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 04:14:59,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25366 states. [2024-10-11 04:15:00,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25366 to 17581. [2024-10-11 04:15:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17581 states, 16077 states have (on average 1.620451576786714) internal successors, (26052), 16144 states have internal predecessors, (26052), 1048 states have call successors, (1048), 391 states have call predecessors, (1048), 454 states have return successors, (1839), 1109 states have call predecessors, (1839), 1046 states have call successors, (1839) [2024-10-11 04:15:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17581 states to 17581 states and 28939 transitions. [2024-10-11 04:15:00,485 INFO L78 Accepts]: Start accepts. Automaton has 17581 states and 28939 transitions. Word has length 122 [2024-10-11 04:15:00,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:00,485 INFO L471 AbstractCegarLoop]: Abstraction has 17581 states and 28939 transitions. [2024-10-11 04:15:00,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:15:00,486 INFO L276 IsEmpty]: Start isEmpty. Operand 17581 states and 28939 transitions. [2024-10-11 04:15:00,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 04:15:00,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:00,500 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] [2024-10-11 04:15:00,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:15:00,500 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:00,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:00,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2142062724, now seen corresponding path program 1 times [2024-10-11 04:15:00,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:00,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315438983] [2024-10-11 04:15:00,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:00,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:00,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:00,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:15:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:00,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:15:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:00,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:15:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:00,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:15:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:00,697 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:15:00,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:00,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315438983] [2024-10-11 04:15:00,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315438983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:00,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:00,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:00,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124081930] [2024-10-11 04:15:00,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:00,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:00,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:00,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:00,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:00,700 INFO L87 Difference]: Start difference. First operand 17581 states and 28939 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:15:05,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:05,508 INFO L93 Difference]: Finished difference Result 62074 states and 101957 transitions. [2024-10-11 04:15:05,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:15:05,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-11 04:15:05,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:05,705 INFO L225 Difference]: With dead ends: 62074 [2024-10-11 04:15:05,706 INFO L226 Difference]: Without dead ends: 46628 [2024-10-11 04:15:05,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:15:05,765 INFO L432 NwaCegarLoop]: 4318 mSDtfsCounter, 5235 mSDsluCounter, 17019 mSDsCounter, 0 mSdLazyCounter, 2482 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5259 SdHoareTripleChecker+Valid, 21337 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:05,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5259 Valid, 21337 Invalid, 2544 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 2482 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 04:15:05,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46628 states. [2024-10-11 04:15:07,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46628 to 32766. [2024-10-11 04:15:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32766 states, 29854 states have (on average 1.603202250954646) internal successors, (47862), 29985 states have internal predecessors, (47862), 2008 states have call successors, (2008), 775 states have call predecessors, (2008), 902 states have return successors, (4321), 2133 states have call predecessors, (4321), 2006 states have call successors, (4321) [2024-10-11 04:15:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32766 states to 32766 states and 54191 transitions. [2024-10-11 04:15:08,031 INFO L78 Accepts]: Start accepts. Automaton has 32766 states and 54191 transitions. Word has length 122 [2024-10-11 04:15:08,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:08,031 INFO L471 AbstractCegarLoop]: Abstraction has 32766 states and 54191 transitions. [2024-10-11 04:15:08,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:15:08,032 INFO L276 IsEmpty]: Start isEmpty. Operand 32766 states and 54191 transitions. [2024-10-11 04:15:08,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 04:15:08,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:08,053 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] [2024-10-11 04:15:08,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:15:08,054 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:08,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:08,054 INFO L85 PathProgramCache]: Analyzing trace with hash 533929658, now seen corresponding path program 1 times [2024-10-11 04:15:08,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:08,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361789438] [2024-10-11 04:15:08,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:08,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:08,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:08,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:15:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:08,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:15:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:08,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:15:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:08,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:15:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:08,244 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:15:08,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:08,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361789438] [2024-10-11 04:15:08,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361789438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:08,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:08,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:08,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954465500] [2024-10-11 04:15:08,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:08,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:08,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:08,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:08,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:08,246 INFO L87 Difference]: Start difference. First operand 32766 states and 54191 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:15:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:15:15,655 INFO L93 Difference]: Finished difference Result 117735 states and 195799 transitions. [2024-10-11 04:15:15,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:15:15,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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 122 [2024-10-11 04:15:15,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:15:16,186 INFO L225 Difference]: With dead ends: 117735 [2024-10-11 04:15:16,186 INFO L226 Difference]: Without dead ends: 87104 [2024-10-11 04:15:16,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:15:16,282 INFO L432 NwaCegarLoop]: 4318 mSDtfsCounter, 5044 mSDsluCounter, 17019 mSDsCounter, 0 mSdLazyCounter, 2770 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5058 SdHoareTripleChecker+Valid, 21337 SdHoareTripleChecker+Invalid, 2831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:15:16,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5058 Valid, 21337 Invalid, 2831 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 2770 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 04:15:16,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87104 states. [2024-10-11 04:15:20,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87104 to 63264. [2024-10-11 04:15:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63264 states, 57600 states have (on average 1.5948958333333334) internal successors, (91866), 57859 states have internal predecessors, (91866), 3864 states have call successors, (3864), 1543 states have call predecessors, (3864), 1798 states have return successors, (10679), 4117 states have call predecessors, (10679), 3862 states have call successors, (10679) [2024-10-11 04:15:20,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63264 states to 63264 states and 106409 transitions. [2024-10-11 04:15:20,953 INFO L78 Accepts]: Start accepts. Automaton has 63264 states and 106409 transitions. Word has length 122 [2024-10-11 04:15:20,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:15:20,954 INFO L471 AbstractCegarLoop]: Abstraction has 63264 states and 106409 transitions. [2024-10-11 04:15:20,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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:15:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 63264 states and 106409 transitions. [2024-10-11 04:15:21,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 04:15:21,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:15:21,003 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] [2024-10-11 04:15:21,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:15:21,004 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:15:21,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:15:21,004 INFO L85 PathProgramCache]: Analyzing trace with hash 505429368, now seen corresponding path program 1 times [2024-10-11 04:15:21,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:15:21,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50819006] [2024-10-11 04:15:21,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:15:21,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:15:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:21,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:15:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:21,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 04:15:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:21,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:15:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:21,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 04:15:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:21,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 04:15:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:15:21,197 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:15:21,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:15:21,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50819006] [2024-10-11 04:15:21,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50819006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:15:21,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:15:21,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:15:21,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159557082] [2024-10-11 04:15:21,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:15:21,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:15:21,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:15:21,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:15:21,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:15:21,200 INFO L87 Difference]: Start difference. First operand 63264 states and 106409 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 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)