./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label41+token_ring.12.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label41+token_ring.12.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5cd7deef4282090ab6b6f93cd9f668fbdecc3b4b6223d600f0bc6a04f939e1e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 16:27:08,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:27:08,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:27:08,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:27:08,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:27:09,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:27:09,033 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:27:09,033 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:27:09,034 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:27:09,034 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:27:09,034 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:27:09,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:27:09,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:27:09,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:27:09,036 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:27:09,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:27:09,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:27:09,037 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:27:09,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:27:09,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:27:09,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:27:09,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:27:09,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:27:09,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:27:09,040 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:27:09,040 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:27:09,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:27:09,041 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:27:09,041 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:27:09,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:27:09,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:27:09,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:27:09,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:27:09,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:27:09,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:27:09,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:27:09,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:27:09,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:27:09,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:27:09,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:27:09,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:27:09,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:27:09,053 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5cd7deef4282090ab6b6f93cd9f668fbdecc3b4b6223d600f0bc6a04f939e1e [2024-11-08 16:27:09,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:27:09,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:27:09,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:27:09,334 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:27:09,335 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:27:09,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label41+token_ring.12.cil-2.c [2024-11-08 16:27:10,891 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:27:11,520 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:27:11,521 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.12.cil-2.c [2024-11-08 16:27:11,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f051ba92c/c5e475c2f2954597a77c44a0e051e846/FLAG70892b1d6 [2024-11-08 16:27:11,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f051ba92c/c5e475c2f2954597a77c44a0e051e846 [2024-11-08 16:27:11,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:27:11,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:27:11,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:27:11,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:27:11,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:27:11,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:27:11" (1/1) ... [2024-11-08 16:27:11,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3f637b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:27:11, skipping insertion in model container [2024-11-08 16:27:11,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:27:11" (1/1) ... [2024-11-08 16:27:12,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:27:13,936 WARN L250 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_label41+token_ring.12.cil-2.c[376251,376264] [2024-11-08 16:27:13,970 WARN L250 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_label41+token_ring.12.cil-2.c[383339,383352] [2024-11-08 16:27:14,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:27:14,247 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:27:15,014 WARN L250 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_label41+token_ring.12.cil-2.c[376251,376264] [2024-11-08 16:27:15,027 WARN L250 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_label41+token_ring.12.cil-2.c[383339,383352] [2024-11-08 16:27:15,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:27:15,119 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:27:15,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:27:15 WrapperNode [2024-11-08 16:27:15,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:27:15,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:27:15,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:27:15,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:27:15,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:27:15" (1/1) ... [2024-11-08 16:27:15,222 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:27:15" (1/1) ... [2024-11-08 16:27:15,605 INFO L138 Inliner]: procedures = 68, calls = 77, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 13233 [2024-11-08 16:27:15,606 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:27:15,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:27:15,607 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:27:15,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:27:15,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:27:15" (1/1) ... [2024-11-08 16:27:15,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:27:15" (1/1) ... [2024-11-08 16:27:15,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:27:15" (1/1) ... [2024-11-08 16:27:15,903 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-11-08 16:27:15,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:27:15" (1/1) ... [2024-11-08 16:27:15,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:27:15" (1/1) ... [2024-11-08 16:27:16,051 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:27:15" (1/1) ... [2024-11-08 16:27:16,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:27:15" (1/1) ... [2024-11-08 16:27:16,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:27:15" (1/1) ... [2024-11-08 16:27:16,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:27:15" (1/1) ... [2024-11-08 16:27:16,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:27:16,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:27:16,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:27:16,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:27:16,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:27:15" (1/1) ... [2024-11-08 16:27:16,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:27:16,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 16:27:16,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:27:16,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:27:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:27:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-08 16:27:16,397 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-08 16:27:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-08 16:27:16,398 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-08 16:27:16,399 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-08 16:27:16,399 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-08 16:27:16,399 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-08 16:27:16,399 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-08 16:27:16,399 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-08 16:27:16,400 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-08 16:27:16,400 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-08 16:27:16,400 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-08 16:27:16,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:27:16,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:27:16,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:27:16,554 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:27:16,556 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:27:24,909 INFO L? ?]: Removed 1755 outVars from TransFormulas that were not future-live. [2024-11-08 16:27:24,909 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:27:24,974 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:27:24,975 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-08 16:27:24,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:27:24 BoogieIcfgContainer [2024-11-08 16:27:24,975 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:27:24,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:27:24,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:27:24,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:27:24,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:27:11" (1/3) ... [2024-11-08 16:27:24,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c02fbcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:27:24, skipping insertion in model container [2024-11-08 16:27:24,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:27:15" (2/3) ... [2024-11-08 16:27:24,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c02fbcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:27:24, skipping insertion in model container [2024-11-08 16:27:24,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:27:24" (3/3) ... [2024-11-08 16:27:24,987 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label41+token_ring.12.cil-2.c [2024-11-08 16:27:25,005 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:27:25,006 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 16:27:25,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:27:25,156 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;@7638b071, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:27:25,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 16:27:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 2578 states, 2543 states have (on average 1.8387731026346834) internal successors, (4676), 2546 states have internal predecessors, (4676), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 16:27:25,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 16:27:25,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:25,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:25,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:27:25,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:27:25,202 INFO L85 PathProgramCache]: Analyzing trace with hash -80490959, now seen corresponding path program 1 times [2024-11-08 16:27:25,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:27:25,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78445375] [2024-11-08 16:27:25,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:25,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:27:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:25,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:27:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:25,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 16:27:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:25,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 16:27:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:25,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 16:27:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:25,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 16:27:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:25,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:27:25,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:27:25,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78445375] [2024-11-08 16:27:25,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78445375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:27:25,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:27:25,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:27:25,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249577720] [2024-11-08 16:27:25,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:27:25,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:27:25,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:27:25,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:27:25,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:27:25,980 INFO L87 Difference]: Start difference. First operand has 2578 states, 2543 states have (on average 1.8387731026346834) internal successors, (4676), 2546 states have internal predecessors, (4676), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:27:28,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:27:28,178 INFO L93 Difference]: Finished difference Result 5292 states and 9690 transitions. [2024-11-08 16:27:28,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:27:28,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2024-11-08 16:27:28,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:27:28,218 INFO L225 Difference]: With dead ends: 5292 [2024-11-08 16:27:28,218 INFO L226 Difference]: Without dead ends: 2653 [2024-11-08 16:27:28,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:27:28,237 INFO L432 NwaCegarLoop]: 4383 mSDtfsCounter, 1051 mSDsluCounter, 12491 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 16874 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:27:28,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 16874 Invalid, 1092 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 16:27:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2024-11-08 16:27:28,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 2511. [2024-11-08 16:27:28,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2477 states have (on average 1.8219620508679855) internal successors, (4513), 2479 states have internal predecessors, (4513), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 16:27:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 4565 transitions. [2024-11-08 16:27:28,413 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 4565 transitions. Word has length 178 [2024-11-08 16:27:28,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:27:28,414 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 4565 transitions. [2024-11-08 16:27:28,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:27:28,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 4565 transitions. [2024-11-08 16:27:28,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 16:27:28,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:28,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:28,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:27:28,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:27:28,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:27:28,431 INFO L85 PathProgramCache]: Analyzing trace with hash -170551249, now seen corresponding path program 1 times [2024-11-08 16:27:28,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:27:28,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954674025] [2024-11-08 16:27:28,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:28,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:27:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:28,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:27:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:28,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 16:27:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:28,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 16:27:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:28,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 16:27:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:28,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 16:27:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:27:28,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:27:28,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954674025] [2024-11-08 16:27:28,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954674025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:27:28,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:27:28,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:27:28,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505624989] [2024-11-08 16:27:28,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:27:28,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:27:28,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:27:28,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:27:28,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:27:28,755 INFO L87 Difference]: Start difference. First operand 2511 states and 4565 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:27:30,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:27:30,688 INFO L93 Difference]: Finished difference Result 3028 states and 5392 transitions. [2024-11-08 16:27:30,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:27:30,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2024-11-08 16:27:30,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:27:30,702 INFO L225 Difference]: With dead ends: 3028 [2024-11-08 16:27:30,703 INFO L226 Difference]: Without dead ends: 2653 [2024-11-08 16:27:30,705 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-11-08 16:27:30,707 INFO L432 NwaCegarLoop]: 4313 mSDtfsCounter, 1037 mSDsluCounter, 12288 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 16601 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:27:30,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 16601 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 16:27:30,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2024-11-08 16:27:30,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 2511. [2024-11-08 16:27:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2477 states have (on average 1.821558336697618) internal successors, (4512), 2479 states have internal predecessors, (4512), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 16:27:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 4564 transitions. [2024-11-08 16:27:30,781 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 4564 transitions. Word has length 178 [2024-11-08 16:27:30,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:27:30,782 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 4564 transitions. [2024-11-08 16:27:30,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:27:30,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 4564 transitions. [2024-11-08 16:27:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 16:27:30,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:30,789 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:30,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:27:30,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:27:30,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:27:30,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1574420435, now seen corresponding path program 1 times [2024-11-08 16:27:30,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:27:30,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868220757] [2024-11-08 16:27:30,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:30,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:27:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:30,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:27:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:30,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 16:27:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:31,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 16:27:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:31,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 16:27:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:31,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 16:27:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:31,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:27:31,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:27:31,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868220757] [2024-11-08 16:27:31,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868220757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:27:31,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:27:31,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:27:31,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521687714] [2024-11-08 16:27:31,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:27:31,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:27:31,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:27:31,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:27:31,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:27:31,125 INFO L87 Difference]: Start difference. First operand 2511 states and 4564 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:27:34,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:27:34,095 INFO L93 Difference]: Finished difference Result 3553 states and 6237 transitions. [2024-11-08 16:27:34,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:27:34,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2024-11-08 16:27:34,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:27:34,109 INFO L225 Difference]: With dead ends: 3553 [2024-11-08 16:27:34,109 INFO L226 Difference]: Without dead ends: 3183 [2024-11-08 16:27:34,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:27:34,112 INFO L432 NwaCegarLoop]: 4283 mSDtfsCounter, 5530 mSDsluCounter, 12868 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5549 SdHoareTripleChecker+Valid, 17151 SdHoareTripleChecker+Invalid, 2372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:27:34,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5549 Valid, 17151 Invalid, 2372 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [108 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 16:27:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states. [2024-11-08 16:27:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 2900. [2024-11-08 16:27:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2900 states, 2838 states have (on average 1.7903453136011276) internal successors, (5081), 2841 states have internal predecessors, (5081), 47 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-11-08 16:27:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 5178 transitions. [2024-11-08 16:27:34,210 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 5178 transitions. Word has length 178 [2024-11-08 16:27:34,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:27:34,212 INFO L471 AbstractCegarLoop]: Abstraction has 2900 states and 5178 transitions. [2024-11-08 16:27:34,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:27:34,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 5178 transitions. [2024-11-08 16:27:34,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 16:27:34,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:34,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:34,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:27:34,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:27:34,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:27:34,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1844561585, now seen corresponding path program 1 times [2024-11-08 16:27:34,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:27:34,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148256081] [2024-11-08 16:27:34,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:34,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:27:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:34,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:27:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:34,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 16:27:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:34,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 16:27:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:34,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 16:27:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:34,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 16:27:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:34,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:27:34,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:27:34,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148256081] [2024-11-08 16:27:34,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148256081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:27:34,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:27:34,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:27:34,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757622315] [2024-11-08 16:27:34,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:27:34,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:27:34,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:27:34,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:27:34,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:27:34,615 INFO L87 Difference]: Start difference. First operand 2900 states and 5178 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:27:38,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:27:38,679 INFO L93 Difference]: Finished difference Result 4492 states and 7737 transitions. [2024-11-08 16:27:38,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:27:38,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2024-11-08 16:27:38,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:27:38,698 INFO L225 Difference]: With dead ends: 4492 [2024-11-08 16:27:38,698 INFO L226 Difference]: Without dead ends: 3733 [2024-11-08 16:27:38,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:27:38,705 INFO L432 NwaCegarLoop]: 4534 mSDtfsCounter, 5565 mSDsluCounter, 17818 mSDsCounter, 0 mSdLazyCounter, 3582 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5584 SdHoareTripleChecker+Valid, 22352 SdHoareTripleChecker+Invalid, 3643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:27:38,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5584 Valid, 22352 Invalid, 3643 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 3582 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-08 16:27:38,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3733 states. [2024-11-08 16:27:38,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3733 to 3262. [2024-11-08 16:27:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3262 states, 3172 states have (on average 1.764186633039092) internal successors, (5596), 3176 states have internal predecessors, (5596), 68 states have call successors, (68), 18 states have call predecessors, (68), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-11-08 16:27:38,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 5737 transitions. [2024-11-08 16:27:38,862 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 5737 transitions. Word has length 178 [2024-11-08 16:27:38,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:27:38,863 INFO L471 AbstractCegarLoop]: Abstraction has 3262 states and 5737 transitions. [2024-11-08 16:27:38,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:27:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 5737 transitions. [2024-11-08 16:27:38,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 16:27:38,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:38,867 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:38,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:27:38,867 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:27:38,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:27:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1233292527, now seen corresponding path program 1 times [2024-11-08 16:27:38,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:27:38,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813196619] [2024-11-08 16:27:38,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:38,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:27:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:39,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:27:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:39,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 16:27:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:39,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 16:27:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:39,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 16:27:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:39,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 16:27:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:27:39,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:27:39,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813196619] [2024-11-08 16:27:39,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813196619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:27:39,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:27:39,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:27:39,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005644638] [2024-11-08 16:27:39,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:27:39,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:27:39,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:27:39,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:27:39,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:27:39,259 INFO L87 Difference]: Start difference. First operand 3262 states and 5737 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:27:42,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:27:42,615 INFO L93 Difference]: Finished difference Result 5877 states and 9930 transitions. [2024-11-08 16:27:42,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:27:42,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2024-11-08 16:27:42,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:27:42,638 INFO L225 Difference]: With dead ends: 5877 [2024-11-08 16:27:42,638 INFO L226 Difference]: Without dead ends: 4756 [2024-11-08 16:27:42,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:27:42,645 INFO L432 NwaCegarLoop]: 4293 mSDtfsCounter, 5677 mSDsluCounter, 17128 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5696 SdHoareTripleChecker+Valid, 21421 SdHoareTripleChecker+Invalid, 3149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:27:42,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5696 Valid, 21421 Invalid, 3149 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [99 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 16:27:42,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4756 states. [2024-11-08 16:27:42,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4756 to 3987. [2024-11-08 16:27:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3987 states, 3841 states have (on average 1.72533194480604) internal successors, (6627), 3847 states have internal predecessors, (6627), 110 states have call successors, (110), 30 states have call predecessors, (110), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-11-08 16:27:42,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3987 states to 3987 states and 6860 transitions. [2024-11-08 16:27:42,819 INFO L78 Accepts]: Start accepts. Automaton has 3987 states and 6860 transitions. Word has length 178 [2024-11-08 16:27:42,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:27:42,819 INFO L471 AbstractCegarLoop]: Abstraction has 3987 states and 6860 transitions. [2024-11-08 16:27:42,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:27:42,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3987 states and 6860 transitions. [2024-11-08 16:27:42,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 16:27:42,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:42,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:42,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:27:42,823 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:27:42,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:27:42,824 INFO L85 PathProgramCache]: Analyzing trace with hash -171899151, now seen corresponding path program 1 times [2024-11-08 16:27:42,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:27:42,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690940790] [2024-11-08 16:27:42,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:42,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:27:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:42,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:27:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:43,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 16:27:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:43,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 16:27:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:43,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 16:27:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:43,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 16:27:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:27:43,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:27:43,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690940790] [2024-11-08 16:27:43,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690940790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:27:43,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:27:43,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:27:43,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904340130] [2024-11-08 16:27:43,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:27:43,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:27:43,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:27:43,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:27:43,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:27:43,154 INFO L87 Difference]: Start difference. First operand 3987 states and 6860 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:27:47,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:27:47,020 INFO L93 Difference]: Finished difference Result 8542 states and 14121 transitions. [2024-11-08 16:27:47,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:27:47,021 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2024-11-08 16:27:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:27:47,058 INFO L225 Difference]: With dead ends: 8542 [2024-11-08 16:27:47,059 INFO L226 Difference]: Without dead ends: 6696 [2024-11-08 16:27:47,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:27:47,073 INFO L432 NwaCegarLoop]: 4532 mSDtfsCounter, 5563 mSDsluCounter, 17818 mSDsCounter, 0 mSdLazyCounter, 3571 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5582 SdHoareTripleChecker+Valid, 22350 SdHoareTripleChecker+Invalid, 3634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:27:47,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5582 Valid, 22350 Invalid, 3634 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3571 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-08 16:27:47,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6696 states. [2024-11-08 16:27:47,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6696 to 5438. [2024-11-08 16:27:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5438 states, 5180 states have (on average 1.6774131274131274) internal successors, (8689), 5190 states have internal predecessors, (8689), 194 states have call successors, (194), 54 states have call predecessors, (194), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-11-08 16:27:47,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5438 states to 5438 states and 9112 transitions. [2024-11-08 16:27:47,328 INFO L78 Accepts]: Start accepts. Automaton has 5438 states and 9112 transitions. Word has length 178 [2024-11-08 16:27:47,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:27:47,329 INFO L471 AbstractCegarLoop]: Abstraction has 5438 states and 9112 transitions. [2024-11-08 16:27:47,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:27:47,329 INFO L276 IsEmpty]: Start isEmpty. Operand 5438 states and 9112 transitions. [2024-11-08 16:27:47,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 16:27:47,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:47,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:47,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:27:47,333 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:27:47,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:27:47,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1722434735, now seen corresponding path program 1 times [2024-11-08 16:27:47,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:27:47,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709872446] [2024-11-08 16:27:47,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:47,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:27:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:47,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:27:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:47,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 16:27:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:47,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 16:27:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:47,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 16:27:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:47,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 16:27:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:27:47,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:27:47,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709872446] [2024-11-08 16:27:47,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709872446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:27:47,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:27:47,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:27:47,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728154205] [2024-11-08 16:27:47,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:27:47,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:27:47,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:27:47,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:27:47,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:27:47,800 INFO L87 Difference]: Start difference. First operand 5438 states and 9112 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:27:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:27:51,669 INFO L93 Difference]: Finished difference Result 13864 states and 22507 transitions. [2024-11-08 16:27:51,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:27:51,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2024-11-08 16:27:51,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:27:51,716 INFO L225 Difference]: With dead ends: 13864 [2024-11-08 16:27:51,716 INFO L226 Difference]: Without dead ends: 10567 [2024-11-08 16:27:51,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:27:51,733 INFO L432 NwaCegarLoop]: 4532 mSDtfsCounter, 5559 mSDsluCounter, 17818 mSDsCounter, 0 mSdLazyCounter, 3543 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5578 SdHoareTripleChecker+Valid, 22350 SdHoareTripleChecker+Invalid, 3606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:27:51,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5578 Valid, 22350 Invalid, 3606 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3543 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 16:27:51,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10567 states. [2024-11-08 16:27:52,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10567 to 8354. [2024-11-08 16:27:52,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8354 states, 7872 states have (on average 1.630716463414634) internal successors, (12837), 7890 states have internal predecessors, (12837), 362 states have call successors, (362), 102 states have call predecessors, (362), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-11-08 16:27:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8354 states to 8354 states and 13658 transitions. [2024-11-08 16:27:52,328 INFO L78 Accepts]: Start accepts. Automaton has 8354 states and 13658 transitions. Word has length 178 [2024-11-08 16:27:52,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:27:52,331 INFO L471 AbstractCegarLoop]: Abstraction has 8354 states and 13658 transitions. [2024-11-08 16:27:52,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:27:52,332 INFO L276 IsEmpty]: Start isEmpty. Operand 8354 states and 13658 transitions. [2024-11-08 16:27:52,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 16:27:52,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:52,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:52,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:27:52,339 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:27:52,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:27:52,340 INFO L85 PathProgramCache]: Analyzing trace with hash 799267309, now seen corresponding path program 1 times [2024-11-08 16:27:52,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:27:52,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964980257] [2024-11-08 16:27:52,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:52,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:27:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:52,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:27:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:52,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 16:27:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:52,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 16:27:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:52,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 16:27:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:52,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 16:27:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:27:52,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:27:52,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964980257] [2024-11-08 16:27:52,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964980257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:27:52,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:27:52,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:27:52,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129727836] [2024-11-08 16:27:52,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:27:52,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:27:52,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:27:52,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:27:52,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:27:52,685 INFO L87 Difference]: Start difference. First operand 8354 states and 13658 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:27:56,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:27:56,584 INFO L93 Difference]: Finished difference Result 24526 states and 39371 transitions. [2024-11-08 16:27:56,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:27:56,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2024-11-08 16:27:56,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:27:56,666 INFO L225 Difference]: With dead ends: 24526 [2024-11-08 16:27:56,667 INFO L226 Difference]: Without dead ends: 18313 [2024-11-08 16:27:56,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:27:56,699 INFO L432 NwaCegarLoop]: 4532 mSDtfsCounter, 5558 mSDsluCounter, 17818 mSDsCounter, 0 mSdLazyCounter, 3530 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5577 SdHoareTripleChecker+Valid, 22350 SdHoareTripleChecker+Invalid, 3593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:27:56,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5577 Valid, 22350 Invalid, 3593 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3530 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 16:27:56,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18313 states. [2024-11-08 16:27:57,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18313 to 14199. [2024-11-08 16:27:57,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14199 states, 13269 states have (on average 1.5940161278167158) internal successors, (21151), 13303 states have internal predecessors, (21151), 698 states have call successors, (698), 198 states have call predecessors, (698), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-11-08 16:27:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14199 states to 14199 states and 22822 transitions. [2024-11-08 16:27:57,518 INFO L78 Accepts]: Start accepts. Automaton has 14199 states and 22822 transitions. Word has length 178 [2024-11-08 16:27:57,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:27:57,519 INFO L471 AbstractCegarLoop]: Abstraction has 14199 states and 22822 transitions. [2024-11-08 16:27:57,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:27:57,519 INFO L276 IsEmpty]: Start isEmpty. Operand 14199 states and 22822 transitions. [2024-11-08 16:27:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 16:27:57,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:27:57,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:27:57,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:27:57,528 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:27:57,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:27:57,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1185129711, now seen corresponding path program 1 times [2024-11-08 16:27:57,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:27:57,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669861194] [2024-11-08 16:27:57,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:27:57,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:27:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:57,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:27:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:57,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 16:27:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:57,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 16:27:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:57,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 16:27:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:57,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 16:27:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:27:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:27:57,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:27:57,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669861194] [2024-11-08 16:27:57,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669861194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:27:57,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:27:57,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:27:57,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754545717] [2024-11-08 16:27:57,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:27:57,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:27:57,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:27:57,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:27:57,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:27:57,837 INFO L87 Difference]: Start difference. First operand 14199 states and 22822 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:28:00,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:28:00,349 INFO L93 Difference]: Finished difference Result 30624 states and 49244 transitions. [2024-11-08 16:28:00,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:28:00,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2024-11-08 16:28:00,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:28:00,416 INFO L225 Difference]: With dead ends: 30624 [2024-11-08 16:28:00,417 INFO L226 Difference]: Without dead ends: 18566 [2024-11-08 16:28:00,454 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-11-08 16:28:00,455 INFO L432 NwaCegarLoop]: 4268 mSDtfsCounter, 5111 mSDsluCounter, 16812 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5131 SdHoareTripleChecker+Valid, 21080 SdHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:28:00,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5131 Valid, 21080 Invalid, 1874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 16:28:00,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18566 states. [2024-11-08 16:28:01,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18566 to 14199. [2024-11-08 16:28:01,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14199 states, 13269 states have (on average 1.5915291280428066) internal successors, (21118), 13303 states have internal predecessors, (21118), 698 states have call successors, (698), 198 states have call predecessors, (698), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-11-08 16:28:01,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14199 states to 14199 states and 22789 transitions. [2024-11-08 16:28:01,095 INFO L78 Accepts]: Start accepts. Automaton has 14199 states and 22789 transitions. Word has length 178 [2024-11-08 16:28:01,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:28:01,095 INFO L471 AbstractCegarLoop]: Abstraction has 14199 states and 22789 transitions. [2024-11-08 16:28:01,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:28:01,096 INFO L276 IsEmpty]: Start isEmpty. Operand 14199 states and 22789 transitions. [2024-11-08 16:28:01,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 16:28:01,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:28:01,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:28:01,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:28:01,106 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:28:01,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:28:01,106 INFO L85 PathProgramCache]: Analyzing trace with hash 920482221, now seen corresponding path program 1 times [2024-11-08 16:28:01,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:28:01,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244141798] [2024-11-08 16:28:01,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:28:01,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:28:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:01,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:28:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:01,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 16:28:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:01,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 16:28:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:01,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 16:28:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:01,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 16:28:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:28:01,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:28:01,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244141798] [2024-11-08 16:28:01,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244141798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:28:01,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:28:01,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:28:01,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835522168] [2024-11-08 16:28:01,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:28:01,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:28:01,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:28:01,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:28:01,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:28:01,423 INFO L87 Difference]: Start difference. First operand 14199 states and 22789 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:28:06,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:28:06,203 INFO L93 Difference]: Finished difference Result 45815 states and 73057 transitions. [2024-11-08 16:28:06,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:28:06,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2024-11-08 16:28:06,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:28:06,326 INFO L225 Difference]: With dead ends: 45815 [2024-11-08 16:28:06,327 INFO L226 Difference]: Without dead ends: 33757 [2024-11-08 16:28:06,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:28:06,359 INFO L432 NwaCegarLoop]: 4532 mSDtfsCounter, 5550 mSDsluCounter, 17818 mSDsCounter, 0 mSdLazyCounter, 3492 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5569 SdHoareTripleChecker+Valid, 22350 SdHoareTripleChecker+Invalid, 3555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:28:06,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5569 Valid, 22350 Invalid, 3555 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3492 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-08 16:28:06,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33757 states. [2024-11-08 16:28:07,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33757 to 25953. [2024-11-08 16:28:07,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25953 states, 24127 states have (on average 1.5664608115389398) internal successors, (37794), 24193 states have internal predecessors, (37794), 1370 states have call successors, (1370), 390 states have call predecessors, (1370), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-11-08 16:28:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25953 states to 25953 states and 41327 transitions. [2024-11-08 16:28:07,492 INFO L78 Accepts]: Start accepts. Automaton has 25953 states and 41327 transitions. Word has length 178 [2024-11-08 16:28:07,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:28:07,492 INFO L471 AbstractCegarLoop]: Abstraction has 25953 states and 41327 transitions. [2024-11-08 16:28:07,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:28:07,492 INFO L276 IsEmpty]: Start isEmpty. Operand 25953 states and 41327 transitions. [2024-11-08 16:28:07,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 16:28:07,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:28:07,508 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:28:07,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:28:07,509 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:28:07,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:28:07,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1443359441, now seen corresponding path program 1 times [2024-11-08 16:28:07,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:28:07,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972802315] [2024-11-08 16:28:07,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:28:07,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:28:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:07,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:28:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:07,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 16:28:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:07,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 16:28:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:07,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 16:28:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:07,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 16:28:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:28:07,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:28:07,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972802315] [2024-11-08 16:28:07,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972802315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:28:07,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:28:07,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:28:07,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630334110] [2024-11-08 16:28:07,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:28:07,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:28:07,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:28:07,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:28:07,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:28:07,798 INFO L87 Difference]: Start difference. First operand 25953 states and 41327 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:28:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:28:13,251 INFO L93 Difference]: Finished difference Result 88463 states and 141305 transitions. [2024-11-08 16:28:13,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:28:13,251 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 178 [2024-11-08 16:28:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:28:13,461 INFO L225 Difference]: With dead ends: 88463 [2024-11-08 16:28:13,462 INFO L226 Difference]: Without dead ends: 64651 [2024-11-08 16:28:13,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:28:13,533 INFO L432 NwaCegarLoop]: 4532 mSDtfsCounter, 5549 mSDsluCounter, 17818 mSDsCounter, 0 mSdLazyCounter, 3479 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5568 SdHoareTripleChecker+Valid, 22350 SdHoareTripleChecker+Invalid, 3542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:28:13,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5568 Valid, 22350 Invalid, 3542 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 3479 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 16:28:13,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64651 states. [2024-11-08 16:28:16,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64651 to 49522. [2024-11-08 16:28:16,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49522 states, 45904 states have (on average 1.5518473335657024) internal successors, (71236), 46034 states have internal predecessors, (71236), 2714 states have call successors, (2714), 774 states have call predecessors, (2714), 902 states have return successors, (5029), 2841 states have call predecessors, (5029), 2714 states have call successors, (5029) [2024-11-08 16:28:16,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49522 states to 49522 states and 78979 transitions. [2024-11-08 16:28:16,573 INFO L78 Accepts]: Start accepts. Automaton has 49522 states and 78979 transitions. Word has length 178 [2024-11-08 16:28:16,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:28:16,574 INFO L471 AbstractCegarLoop]: Abstraction has 49522 states and 78979 transitions. [2024-11-08 16:28:16,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 16:28:16,574 INFO L276 IsEmpty]: Start isEmpty. Operand 49522 states and 78979 transitions. [2024-11-08 16:28:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 16:28:16,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:28:16,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:28:16,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:28:16,600 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:28:16,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:28:16,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1528428909, now seen corresponding path program 1 times [2024-11-08 16:28:16,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:28:16,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543121571] [2024-11-08 16:28:16,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:28:16,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:28:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:16,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 16:28:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:16,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 16:28:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:17,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 16:28:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:17,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 16:28:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:17,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 16:28:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:28:17,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:28:17,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:28:17,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543121571] [2024-11-08 16:28:17,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543121571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:28:17,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:28:17,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:28:17,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761072644] [2024-11-08 16:28:17,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:28:17,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:28:17,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:28:17,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:28:17,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:28:17,034 INFO L87 Difference]: Start difference. First operand 49522 states and 78979 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)