./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-1.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_label46+token_ring.10.cil-1.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 906e84f0a25a0f5132fcddd369ea6157dd86409b963593c3fbd2737ae25908f1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:22:43,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:22:43,675 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:22:43,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:22:43,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:22:43,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:22:43,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:22:43,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:22:43,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:22:43,723 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:22:43,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:22:43,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:22:43,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:22:43,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:22:43,726 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:22:43,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:22:43,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:22:43,729 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:22:43,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:22:43,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:22:43,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:22:43,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:22:43,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:22:43,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:22:43,734 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:22:43,734 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:22:43,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:22:43,734 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:22:43,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:22:43,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:22:43,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:22:43,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:22:43,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:22:43,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:22:43,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:22:43,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:22:43,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:22:43,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:22:43,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:22:43,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:22:43,739 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:22:43,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:22:43,739 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 -> 906e84f0a25a0f5132fcddd369ea6157dd86409b963593c3fbd2737ae25908f1 [2024-10-11 04:22:44,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:22:44,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:22:44,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:22:44,033 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:22:44,034 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:22:44,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-1.c [2024-10-11 04:22:45,629 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:22:46,207 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:22:46,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-1.c [2024-10-11 04:22:46,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6b899fe73/72ffd51e65b04c5da5fdbda70d2558e8/FLAGe94c39bfb [2024-10-11 04:22:46,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6b899fe73/72ffd51e65b04c5da5fdbda70d2558e8 [2024-10-11 04:22:46,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:22:46,296 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:22:46,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:22:46,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:22:46,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:22:46,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:22:46" (1/1) ... [2024-10-11 04:22:46,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40b3df01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:46, skipping insertion in model container [2024-10-11 04:22:46,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:22:46" (1/1) ... [2024-10-11 04:22:46,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:22:48,276 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-1.c[382357,382370] [2024-10-11 04:22:48,301 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-1.c[383339,383352] [2024-10-11 04:22:48,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:22:48,551 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:22:49,271 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-1.c[382357,382370] [2024-10-11 04:22:49,276 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.10.cil-1.c[383339,383352] [2024-10-11 04:22:49,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:22:49,413 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:22:49,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:49 WrapperNode [2024-10-11 04:22:49,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:22:49,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:22:49,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:22:49,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:22:49,421 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:22:49" (1/1) ... [2024-10-11 04:22:49,526 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:22:49" (1/1) ... [2024-10-11 04:22:49,924 INFO L138 Inliner]: procedures = 64, calls = 72, calls flagged for inlining = 41, calls inlined = 41, statements flattened = 13119 [2024-10-11 04:22:49,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:22:49,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:22:49,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:22:49,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:22:49,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:49" (1/1) ... [2024-10-11 04:22:49,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:49" (1/1) ... [2024-10-11 04:22:50,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:49" (1/1) ... [2024-10-11 04:22:50,199 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:22:50,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:49" (1/1) ... [2024-10-11 04:22:50,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:49" (1/1) ... [2024-10-11 04:22:50,329 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:49" (1/1) ... [2024-10-11 04:22:50,400 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:49" (1/1) ... [2024-10-11 04:22:50,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:49" (1/1) ... [2024-10-11 04:22:50,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:49" (1/1) ... [2024-10-11 04:22:50,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:22:50,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:22:50,544 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:22:50,544 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:22:50,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:49" (1/1) ... [2024-10-11 04:22:50,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:22:50,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:22:50,579 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:22:50,581 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:22:50,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:22:50,630 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:22:50,630 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:22:50,630 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:22:50,632 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:22:50,632 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:22:50,632 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:22:50,632 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 04:22:50,632 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 04:22:50,632 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:22:50,633 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:22:50,633 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:22:50,633 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:22:50,633 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:22:50,633 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:22:50,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:22:50,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:22:50,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:22:50,798 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:22:50,801 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:22:58,550 INFO L? ?]: Removed 1747 outVars from TransFormulas that were not future-live. [2024-10-11 04:22:58,550 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:22:58,695 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:22:58,696 INFO L314 CfgBuilder]: Removed 14 assume(true) statements. [2024-10-11 04:22:58,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:22:58 BoogieIcfgContainer [2024-10-11 04:22:58,696 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:22:58,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:22:58,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:22:58,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:22:58,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:22:46" (1/3) ... [2024-10-11 04:22:58,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3128c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:22:58, skipping insertion in model container [2024-10-11 04:22:58,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:22:49" (2/3) ... [2024-10-11 04:22:58,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3128c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:22:58, skipping insertion in model container [2024-10-11 04:22:58,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:22:58" (3/3) ... [2024-10-11 04:22:58,706 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.10.cil-1.c [2024-10-11 04:22:58,723 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:22:58,723 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:22:58,846 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:22:58,856 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;@1edb9562, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:22:58,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:22:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 2433 states, 2397 states have (on average 1.8777638715060492) internal successors, (4501), 2402 states have internal predecessors, (4501), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 04:22:58,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:22:58,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:22:58,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:22:58,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:22:58,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:22:58,893 INFO L85 PathProgramCache]: Analyzing trace with hash 177610299, now seen corresponding path program 1 times [2024-10-11 04:22:58,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:22:58,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862339637] [2024-10-11 04:22:58,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:22:58,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:22:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:59,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:22:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:59,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:22:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:59,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:22:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:59,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:22:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:59,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:22:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:22:59,511 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:22:59,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:22:59,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862339637] [2024-10-11 04:22:59,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862339637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:22:59,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:22:59,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:22:59,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519856044] [2024-10-11 04:22:59,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:22:59,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:22:59,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:22:59,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:22:59,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:22:59,553 INFO L87 Difference]: Start difference. First operand has 2433 states, 2397 states have (on average 1.8777638715060492) internal successors, (4501), 2402 states have internal predecessors, (4501), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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:23:01,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:01,473 INFO L93 Difference]: Finished difference Result 4967 states and 9286 transitions. [2024-10-11 04:23:01,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:23:01,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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 142 [2024-10-11 04:23:01,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:01,501 INFO L225 Difference]: With dead ends: 4967 [2024-10-11 04:23:01,502 INFO L226 Difference]: Without dead ends: 2538 [2024-10-11 04:23:01,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:23:01,513 INFO L432 NwaCegarLoop]: 4230 mSDtfsCounter, 851 mSDsluCounter, 12178 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 16408 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:01,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 16408 Invalid, 968 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 04:23:01,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2024-10-11 04:23:01,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2428. [2024-10-11 04:23:01,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2428 states, 2394 states have (on average 1.840016708437761) internal successors, (4405), 2397 states have internal predecessors, (4405), 26 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 04:23:01,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 4455 transitions. [2024-10-11 04:23:01,673 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 4455 transitions. Word has length 142 [2024-10-11 04:23:01,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:01,674 INFO L471 AbstractCegarLoop]: Abstraction has 2428 states and 4455 transitions. [2024-10-11 04:23:01,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 3 states have internal predecessors, (131), 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:23:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 4455 transitions. [2024-10-11 04:23:01,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:23:01,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:01,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:01,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:23:01,682 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:01,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:01,684 INFO L85 PathProgramCache]: Analyzing trace with hash 722482873, now seen corresponding path program 1 times [2024-10-11 04:23:01,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:01,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324608782] [2024-10-11 04:23:01,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:01,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:01,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:01,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:02,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:02,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:02,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:02,165 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:23:02,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:02,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324608782] [2024-10-11 04:23:02,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324608782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:02,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:02,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:02,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681953034] [2024-10-11 04:23:02,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:02,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:02,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:02,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:02,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:02,170 INFO L87 Difference]: Start difference. First operand 2428 states and 4455 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:05,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:05,834 INFO L93 Difference]: Finished difference Result 3266 states and 5862 transitions. [2024-10-11 04:23:05,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:23:05,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:23:05,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:05,851 INFO L225 Difference]: With dead ends: 3266 [2024-10-11 04:23:05,851 INFO L226 Difference]: Without dead ends: 2975 [2024-10-11 04:23:05,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:23:05,856 INFO L432 NwaCegarLoop]: 4383 mSDtfsCounter, 5177 mSDsluCounter, 17236 mSDsCounter, 0 mSdLazyCounter, 3307 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5194 SdHoareTripleChecker+Valid, 21619 SdHoareTripleChecker+Invalid, 3373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:05,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5194 Valid, 21619 Invalid, 3373 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [66 Valid, 3307 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 04:23:05,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2024-10-11 04:23:05,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2736. [2024-10-11 04:23:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2736 states, 2673 states have (on average 1.8204264870931537) internal successors, (4866), 2678 states have internal predecessors, (4866), 47 states have call successors, (47), 13 states have call predecessors, (47), 14 states have return successors, (52), 46 states have call predecessors, (52), 45 states have call successors, (52) [2024-10-11 04:23:05,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 4965 transitions. [2024-10-11 04:23:05,957 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 4965 transitions. Word has length 142 [2024-10-11 04:23:05,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:05,957 INFO L471 AbstractCegarLoop]: Abstraction has 2736 states and 4965 transitions. [2024-10-11 04:23:05,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:05,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 4965 transitions. [2024-10-11 04:23:05,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:23:05,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:05,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:05,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:23:05,961 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:05,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:05,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1327926025, now seen corresponding path program 1 times [2024-10-11 04:23:05,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:05,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129897067] [2024-10-11 04:23:05,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:05,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:06,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:06,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:06,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:06,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:06,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:06,272 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:23:06,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:06,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129897067] [2024-10-11 04:23:06,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129897067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:06,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:06,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:06,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555089105] [2024-10-11 04:23:06,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:06,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:06,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:06,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:06,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:06,277 INFO L87 Difference]: Start difference. First operand 2736 states and 4965 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:09,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:09,418 INFO L93 Difference]: Finished difference Result 4324 states and 7612 transitions. [2024-10-11 04:23:09,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:23:09,418 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:23:09,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:09,437 INFO L225 Difference]: With dead ends: 4324 [2024-10-11 04:23:09,438 INFO L226 Difference]: Without dead ends: 3727 [2024-10-11 04:23:09,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:23:09,444 INFO L432 NwaCegarLoop]: 4334 mSDtfsCounter, 5218 mSDsluCounter, 17172 mSDsCounter, 0 mSdLazyCounter, 3009 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5235 SdHoareTripleChecker+Valid, 21506 SdHoareTripleChecker+Invalid, 3083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 3009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:09,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5235 Valid, 21506 Invalid, 3083 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [74 Valid, 3009 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 04:23:09,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2024-10-11 04:23:09,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3300. [2024-10-11 04:23:09,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3185 states have (on average 1.7886970172684458) internal successors, (5697), 3192 states have internal predecessors, (5697), 85 states have call successors, (85), 25 states have call predecessors, (85), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-11 04:23:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 5882 transitions. [2024-10-11 04:23:09,579 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 5882 transitions. Word has length 142 [2024-10-11 04:23:09,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:09,579 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 5882 transitions. [2024-10-11 04:23:09,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 5882 transitions. [2024-10-11 04:23:09,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:23:09,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:09,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:09,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:23:09,583 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:09,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:09,584 INFO L85 PathProgramCache]: Analyzing trace with hash -839878919, now seen corresponding path program 1 times [2024-10-11 04:23:09,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:09,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426446614] [2024-10-11 04:23:09,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:09,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:09,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:09,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:09,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:09,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:09,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:09,881 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:23:09,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:09,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426446614] [2024-10-11 04:23:09,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426446614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:09,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:09,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:09,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537577423] [2024-10-11 04:23:09,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:09,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:09,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:09,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:09,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:09,885 INFO L87 Difference]: Start difference. First operand 3300 states and 5882 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:11,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:11,601 INFO L93 Difference]: Finished difference Result 4901 states and 8568 transitions. [2024-10-11 04:23:11,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:23:11,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:23:11,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:11,618 INFO L225 Difference]: With dead ends: 4901 [2024-10-11 04:23:11,619 INFO L226 Difference]: Without dead ends: 3738 [2024-10-11 04:23:11,627 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:23:11,628 INFO L432 NwaCegarLoop]: 4186 mSDtfsCounter, 4885 mSDsluCounter, 16532 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4903 SdHoareTripleChecker+Valid, 20718 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:11,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4903 Valid, 20718 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:23:11,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2024-10-11 04:23:11,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 3300. [2024-10-11 04:23:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3185 states have (on average 1.78712715855573) internal successors, (5692), 3192 states have internal predecessors, (5692), 85 states have call successors, (85), 25 states have call predecessors, (85), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-11 04:23:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 5877 transitions. [2024-10-11 04:23:11,759 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 5877 transitions. Word has length 142 [2024-10-11 04:23:11,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:11,760 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 5877 transitions. [2024-10-11 04:23:11,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:11,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 5877 transitions. [2024-10-11 04:23:11,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:23:11,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:11,763 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:11,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:23:11,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:11,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:11,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1932514121, now seen corresponding path program 1 times [2024-10-11 04:23:11,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:11,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24881237] [2024-10-11 04:23:11,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:11,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:11,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:11,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:11,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:12,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:12,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:12,020 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:23:12,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:12,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24881237] [2024-10-11 04:23:12,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24881237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:12,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:12,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:12,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557923250] [2024-10-11 04:23:12,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:12,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:12,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:12,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:12,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:12,023 INFO L87 Difference]: Start difference. First operand 3300 states and 5877 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:13,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:13,614 INFO L93 Difference]: Finished difference Result 4897 states and 8547 transitions. [2024-10-11 04:23:13,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:23:13,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:23:13,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:13,629 INFO L225 Difference]: With dead ends: 4897 [2024-10-11 04:23:13,629 INFO L226 Difference]: Without dead ends: 3734 [2024-10-11 04:23:13,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:23:13,635 INFO L432 NwaCegarLoop]: 4186 mSDtfsCounter, 4883 mSDsluCounter, 16532 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4901 SdHoareTripleChecker+Valid, 20718 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:13,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4901 Valid, 20718 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:23:13,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2024-10-11 04:23:13,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3300. [2024-10-11 04:23:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3185 states have (on average 1.785557299843014) internal successors, (5687), 3192 states have internal predecessors, (5687), 85 states have call successors, (85), 25 states have call predecessors, (85), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-11 04:23:13,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 5872 transitions. [2024-10-11 04:23:13,778 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 5872 transitions. Word has length 142 [2024-10-11 04:23:13,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:13,778 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 5872 transitions. [2024-10-11 04:23:13,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:13,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 5872 transitions. [2024-10-11 04:23:13,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:23:13,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:13,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:13,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:23:13,782 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:13,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:13,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1080280889, now seen corresponding path program 1 times [2024-10-11 04:23:13,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:13,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888088135] [2024-10-11 04:23:13,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:13,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:13,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:13,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:14,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:14,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:14,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:14,070 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:23:14,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:14,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888088135] [2024-10-11 04:23:14,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888088135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:14,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:14,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:14,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672202458] [2024-10-11 04:23:14,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:14,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:14,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:14,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:14,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:14,074 INFO L87 Difference]: Start difference. First operand 3300 states and 5872 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:15,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:15,513 INFO L93 Difference]: Finished difference Result 4892 states and 8524 transitions. [2024-10-11 04:23:15,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:23:15,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:23:15,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:15,530 INFO L225 Difference]: With dead ends: 4892 [2024-10-11 04:23:15,530 INFO L226 Difference]: Without dead ends: 3729 [2024-10-11 04:23:15,535 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:23:15,536 INFO L432 NwaCegarLoop]: 4186 mSDtfsCounter, 4881 mSDsluCounter, 16532 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4899 SdHoareTripleChecker+Valid, 20718 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:15,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4899 Valid, 20718 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:23:15,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3729 states. [2024-10-11 04:23:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3729 to 3300. [2024-10-11 04:23:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 3185 states have (on average 1.7839874411302983) internal successors, (5682), 3192 states have internal predecessors, (5682), 85 states have call successors, (85), 25 states have call predecessors, (85), 28 states have return successors, (100), 86 states have call predecessors, (100), 83 states have call successors, (100) [2024-10-11 04:23:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 5867 transitions. [2024-10-11 04:23:15,776 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 5867 transitions. Word has length 142 [2024-10-11 04:23:15,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:15,776 INFO L471 AbstractCegarLoop]: Abstraction has 3300 states and 5867 transitions. [2024-10-11 04:23:15,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:15,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 5867 transitions. [2024-10-11 04:23:15,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:23:15,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:15,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:15,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:23:15,780 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:15,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:15,781 INFO L85 PathProgramCache]: Analyzing trace with hash -762194825, now seen corresponding path program 1 times [2024-10-11 04:23:15,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:15,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820234762] [2024-10-11 04:23:15,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:15,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:15,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:15,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:16,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:16,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:16,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:16,071 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:23:16,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:16,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820234762] [2024-10-11 04:23:16,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820234762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:16,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:16,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:16,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668130015] [2024-10-11 04:23:16,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:16,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:16,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:16,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:16,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:16,074 INFO L87 Difference]: Start difference. First operand 3300 states and 5867 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:19,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:19,482 INFO L93 Difference]: Finished difference Result 6373 states and 10927 transitions. [2024-10-11 04:23:19,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:23:19,482 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:23:19,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:19,505 INFO L225 Difference]: With dead ends: 6373 [2024-10-11 04:23:19,506 INFO L226 Difference]: Without dead ends: 5212 [2024-10-11 04:23:19,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:23:19,513 INFO L432 NwaCegarLoop]: 4380 mSDtfsCounter, 5168 mSDsluCounter, 17236 mSDsCounter, 0 mSdLazyCounter, 3213 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5185 SdHoareTripleChecker+Valid, 21616 SdHoareTripleChecker+Invalid, 3281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:19,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5185 Valid, 21616 Invalid, 3281 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [68 Valid, 3213 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 04:23:19,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5212 states. [2024-10-11 04:23:19,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5212 to 4439. [2024-10-11 04:23:19,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4439 states, 4220 states have (on average 1.740047393364929) internal successors, (7343), 4231 states have internal predecessors, (7343), 161 states have call successors, (161), 49 states have call predecessors, (161), 56 states have return successors, (202), 166 states have call predecessors, (202), 159 states have call successors, (202) [2024-10-11 04:23:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4439 states to 4439 states and 7706 transitions. [2024-10-11 04:23:19,806 INFO L78 Accepts]: Start accepts. Automaton has 4439 states and 7706 transitions. Word has length 142 [2024-10-11 04:23:19,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:19,807 INFO L471 AbstractCegarLoop]: Abstraction has 4439 states and 7706 transitions. [2024-10-11 04:23:19,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:19,812 INFO L276 IsEmpty]: Start isEmpty. Operand 4439 states and 7706 transitions. [2024-10-11 04:23:19,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:23:19,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:19,816 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:19,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:23:19,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:19,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:19,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1810769785, now seen corresponding path program 1 times [2024-10-11 04:23:19,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:19,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19337753] [2024-10-11 04:23:19,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:19,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:19,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:19,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:20,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:20,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:20,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:23:20,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:20,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19337753] [2024-10-11 04:23:20,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19337753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:20,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:20,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:20,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175330201] [2024-10-11 04:23:20,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:20,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:20,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:20,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:20,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:20,058 INFO L87 Difference]: Start difference. First operand 4439 states and 7706 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:21,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:21,708 INFO L93 Difference]: Finished difference Result 7548 states and 12863 transitions. [2024-10-11 04:23:21,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:23:21,708 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:23:21,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:21,727 INFO L225 Difference]: With dead ends: 7548 [2024-10-11 04:23:21,728 INFO L226 Difference]: Without dead ends: 5246 [2024-10-11 04:23:21,736 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:23:21,737 INFO L432 NwaCegarLoop]: 4186 mSDtfsCounter, 4885 mSDsluCounter, 16532 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4903 SdHoareTripleChecker+Valid, 20718 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:21,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4903 Valid, 20718 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:23:21,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2024-10-11 04:23:21,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 4439. [2024-10-11 04:23:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4439 states, 4220 states have (on average 1.7379146919431279) internal successors, (7334), 4231 states have internal predecessors, (7334), 161 states have call successors, (161), 49 states have call predecessors, (161), 56 states have return successors, (202), 166 states have call predecessors, (202), 159 states have call successors, (202) [2024-10-11 04:23:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4439 states to 4439 states and 7697 transitions. [2024-10-11 04:23:21,912 INFO L78 Accepts]: Start accepts. Automaton has 4439 states and 7697 transitions. Word has length 142 [2024-10-11 04:23:21,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:21,912 INFO L471 AbstractCegarLoop]: Abstraction has 4439 states and 7697 transitions. [2024-10-11 04:23:21,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:21,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4439 states and 7697 transitions. [2024-10-11 04:23:21,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:23:21,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:21,916 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:21,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:23:21,916 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:21,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:21,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1478126647, now seen corresponding path program 1 times [2024-10-11 04:23:21,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:21,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404718131] [2024-10-11 04:23:21,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:21,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:22,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:22,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:22,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:22,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:22,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:22,169 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:23:22,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:22,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404718131] [2024-10-11 04:23:22,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404718131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:22,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:22,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:22,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217113403] [2024-10-11 04:23:22,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:22,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:22,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:22,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:22,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:22,172 INFO L87 Difference]: Start difference. First operand 4439 states and 7697 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:25,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:25,175 INFO L93 Difference]: Finished difference Result 10480 states and 17612 transitions. [2024-10-11 04:23:25,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:23:25,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:23:25,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:25,205 INFO L225 Difference]: With dead ends: 10480 [2024-10-11 04:23:25,205 INFO L226 Difference]: Without dead ends: 8180 [2024-10-11 04:23:25,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:23:25,215 INFO L432 NwaCegarLoop]: 4380 mSDtfsCounter, 5200 mSDsluCounter, 17236 mSDsCounter, 0 mSdLazyCounter, 3093 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5217 SdHoareTripleChecker+Valid, 21616 SdHoareTripleChecker+Invalid, 3161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:25,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5217 Valid, 21616 Invalid, 3161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3093 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 04:23:25,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8180 states. [2024-10-11 04:23:25,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8180 to 6739. [2024-10-11 04:23:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6739 states, 6312 states have (on average 1.692173637515843) internal successors, (10681), 6331 states have internal predecessors, (10681), 313 states have call successors, (313), 97 states have call predecessors, (313), 112 states have return successors, (424), 326 states have call predecessors, (424), 311 states have call successors, (424) [2024-10-11 04:23:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6739 states to 6739 states and 11418 transitions. [2024-10-11 04:23:25,569 INFO L78 Accepts]: Start accepts. Automaton has 6739 states and 11418 transitions. Word has length 142 [2024-10-11 04:23:25,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:25,569 INFO L471 AbstractCegarLoop]: Abstraction has 6739 states and 11418 transitions. [2024-10-11 04:23:25,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:25,569 INFO L276 IsEmpty]: Start isEmpty. Operand 6739 states and 11418 transitions. [2024-10-11 04:23:25,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:23:25,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:25,574 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:25,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:23:25,575 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:25,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:25,575 INFO L85 PathProgramCache]: Analyzing trace with hash -814954379, now seen corresponding path program 1 times [2024-10-11 04:23:25,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:25,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436963420] [2024-10-11 04:23:25,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:25,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:25,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:25,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:25,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:25,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:25,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:25,810 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:23:25,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:25,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436963420] [2024-10-11 04:23:25,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436963420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:25,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:25,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:25,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547873644] [2024-10-11 04:23:25,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:25,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:25,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:25,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:25,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:25,813 INFO L87 Difference]: Start difference. First operand 6739 states and 11418 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:29,003 INFO L93 Difference]: Finished difference Result 18724 states and 31133 transitions. [2024-10-11 04:23:29,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:23:29,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:23:29,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:29,066 INFO L225 Difference]: With dead ends: 18724 [2024-10-11 04:23:29,066 INFO L226 Difference]: Without dead ends: 14124 [2024-10-11 04:23:29,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:23:29,091 INFO L432 NwaCegarLoop]: 4333 mSDtfsCounter, 5226 mSDsluCounter, 17172 mSDsCounter, 0 mSdLazyCounter, 2842 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5243 SdHoareTripleChecker+Valid, 21505 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:29,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5243 Valid, 21505 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2842 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 04:23:29,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14124 states. [2024-10-11 04:23:29,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14124 to 11355. [2024-10-11 04:23:29,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11355 states, 10512 states have (on average 1.65515601217656) internal successors, (17399), 10547 states have internal predecessors, (17399), 617 states have call successors, (617), 193 states have call predecessors, (617), 224 states have return successors, (922), 646 states have call predecessors, (922), 615 states have call successors, (922) [2024-10-11 04:23:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11355 states to 11355 states and 18938 transitions. [2024-10-11 04:23:29,959 INFO L78 Accepts]: Start accepts. Automaton has 11355 states and 18938 transitions. Word has length 142 [2024-10-11 04:23:29,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:29,960 INFO L471 AbstractCegarLoop]: Abstraction has 11355 states and 18938 transitions. [2024-10-11 04:23:29,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:29,960 INFO L276 IsEmpty]: Start isEmpty. Operand 11355 states and 18938 transitions. [2024-10-11 04:23:29,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:23:29,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:29,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:29,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:23:29,969 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:29,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:29,970 INFO L85 PathProgramCache]: Analyzing trace with hash 912190583, now seen corresponding path program 1 times [2024-10-11 04:23:29,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:29,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495333086] [2024-10-11 04:23:29,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:29,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:30,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:30,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:30,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:30,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:30,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:30,221 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:23:30,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:30,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495333086] [2024-10-11 04:23:30,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495333086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:30,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:30,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:30,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391294274] [2024-10-11 04:23:30,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:30,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:30,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:30,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:30,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:30,224 INFO L87 Difference]: Start difference. First operand 11355 states and 18938 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:34,253 INFO L93 Difference]: Finished difference Result 39308 states and 64993 transitions. [2024-10-11 04:23:34,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:23:34,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:23:34,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:34,380 INFO L225 Difference]: With dead ends: 39308 [2024-10-11 04:23:34,380 INFO L226 Difference]: Without dead ends: 30092 [2024-10-11 04:23:34,427 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:23:34,428 INFO L432 NwaCegarLoop]: 4380 mSDtfsCounter, 5566 mSDsluCounter, 17231 mSDsCounter, 0 mSdLazyCounter, 3067 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5594 SdHoareTripleChecker+Valid, 21611 SdHoareTripleChecker+Invalid, 3138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 3067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:34,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5594 Valid, 21611 Invalid, 3138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 3067 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 04:23:34,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30092 states. [2024-10-11 04:23:35,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30092 to 20555. [2024-10-11 04:23:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20555 states, 18912 states have (on average 1.6312923011844331) internal successors, (30851), 18979 states have internal predecessors, (30851), 1193 states have call successors, (1193), 385 states have call predecessors, (1193), 448 states have return successors, (2048), 1254 states have call predecessors, (2048), 1191 states have call successors, (2048) [2024-10-11 04:23:35,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20555 states to 20555 states and 34092 transitions. [2024-10-11 04:23:35,771 INFO L78 Accepts]: Start accepts. Automaton has 20555 states and 34092 transitions. Word has length 142 [2024-10-11 04:23:35,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:35,771 INFO L471 AbstractCegarLoop]: Abstraction has 20555 states and 34092 transitions. [2024-10-11 04:23:35,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:35,772 INFO L276 IsEmpty]: Start isEmpty. Operand 20555 states and 34092 transitions. [2024-10-11 04:23:35,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:23:35,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:35,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:35,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:23:35,787 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:35,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:35,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1383546933, now seen corresponding path program 1 times [2024-10-11 04:23:35,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:35,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989311776] [2024-10-11 04:23:35,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:35,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:35,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:35,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:35,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:36,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:36,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:36,015 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:23:36,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:36,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989311776] [2024-10-11 04:23:36,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989311776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:36,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:36,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:36,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402727782] [2024-10-11 04:23:36,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:36,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:36,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:36,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:36,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:36,017 INFO L87 Difference]: Start difference. First operand 20555 states and 34092 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:41,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:41,830 INFO L93 Difference]: Finished difference Result 75484 states and 125245 transitions. [2024-10-11 04:23:41,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:23:41,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:23:41,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:42,052 INFO L225 Difference]: With dead ends: 75484 [2024-10-11 04:23:42,052 INFO L226 Difference]: Without dead ends: 57068 [2024-10-11 04:23:42,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:23:42,120 INFO L432 NwaCegarLoop]: 4376 mSDtfsCounter, 5285 mSDsluCounter, 17228 mSDsCounter, 0 mSdLazyCounter, 3603 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5301 SdHoareTripleChecker+Valid, 21604 SdHoareTripleChecker+Invalid, 3673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 3603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:42,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5301 Valid, 21604 Invalid, 3673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 3603 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 04:23:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57068 states. [2024-10-11 04:23:44,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57068 to 38315. [2024-10-11 04:23:44,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38315 states, 35104 states have (on average 1.614260483135825) internal successors, (56667), 35235 states have internal predecessors, (56667), 2313 states have call successors, (2313), 769 states have call predecessors, (2313), 896 states have return successors, (4754), 2438 states have call predecessors, (4754), 2311 states have call successors, (4754) [2024-10-11 04:23:44,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38315 states to 38315 states and 63734 transitions. [2024-10-11 04:23:44,546 INFO L78 Accepts]: Start accepts. Automaton has 38315 states and 63734 transitions. Word has length 142 [2024-10-11 04:23:44,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:23:44,546 INFO L471 AbstractCegarLoop]: Abstraction has 38315 states and 63734 transitions. [2024-10-11 04:23:44,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:44,547 INFO L276 IsEmpty]: Start isEmpty. Operand 38315 states and 63734 transitions. [2024-10-11 04:23:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 04:23:44,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:23:44,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:23:44,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:23:44,567 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:23:44,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:23:44,568 INFO L85 PathProgramCache]: Analyzing trace with hash -263816009, now seen corresponding path program 1 times [2024-10-11 04:23:44,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:23:44,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708648229] [2024-10-11 04:23:44,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:23:44,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:23:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:44,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:23:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:44,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 04:23:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:44,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 04:23:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:44,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 04:23:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:44,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 04:23:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:23:44,781 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:23:44,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:23:44,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708648229] [2024-10-11 04:23:44,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708648229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:23:44,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:23:44,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:23:44,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983412003] [2024-10-11 04:23:44,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:23:44,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:23:44,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:23:44,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:23:44,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:23:44,784 INFO L87 Difference]: Start difference. First operand 38315 states and 63734 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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:23:53,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:23:53,905 INFO L93 Difference]: Finished difference Result 145020 states and 242573 transitions. [2024-10-11 04:23:53,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:23:53,905 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 5 states have internal predecessors, (131), 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 142 [2024-10-11 04:23:53,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:23:54,314 INFO L225 Difference]: With dead ends: 145020 [2024-10-11 04:23:54,315 INFO L226 Difference]: Without dead ends: 108844 [2024-10-11 04:23:54,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:23:54,429 INFO L432 NwaCegarLoop]: 4379 mSDtfsCounter, 5498 mSDsluCounter, 17231 mSDsCounter, 0 mSdLazyCounter, 3036 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5526 SdHoareTripleChecker+Valid, 21610 SdHoareTripleChecker+Invalid, 3107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 3036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:23:54,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5526 Valid, 21610 Invalid, 3107 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [71 Valid, 3036 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 04:23:54,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108844 states.