./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.11.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ae9f818c1f032966d67b2bd4627e73bc680f5fe59ca24bfc7cff4e83563ff8e3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:12:58,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:12:58,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:12:58,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:12:58,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:12:58,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:12:58,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:12:58,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:12:58,958 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:12:58,958 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:12:58,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:12:58,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:12:58,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:12:58,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:12:58,960 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:12:58,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:12:58,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:12:58,961 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:12:58,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:12:58,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:12:58,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:12:58,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:12:58,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:12:58,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:12:58,964 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:12:58,964 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:12:58,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:12:58,965 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:12:58,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:12:58,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:12:58,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:12:58,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:12:58,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:12:58,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:12:58,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:12:58,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:12:58,968 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:12:58,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:12:58,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:12:58,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:12:58,969 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:12:58,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:12:58,974 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae9f818c1f032966d67b2bd4627e73bc680f5fe59ca24bfc7cff4e83563ff8e3 [2024-10-11 04:12:59,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:12:59,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:12:59,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:12:59,301 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:12:59,302 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:12:59,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.11.cil-2.c [2024-10-11 04:13:00,708 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:13:01,327 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:13:01,328 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.11.cil-2.c [2024-10-11 04:13:01,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a47fc803b/110808bd7e014ce8a97b389b152fa5dc/FLAG7b6319fde [2024-10-11 04:13:01,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a47fc803b/110808bd7e014ce8a97b389b152fa5dc [2024-10-11 04:13:01,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:13:01,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:13:01,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:13:01,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:13:01,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:13:01,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:13:01" (1/1) ... [2024-10-11 04:13:01,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35535b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:01, skipping insertion in model container [2024-10-11 04:13:01,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:13:01" (1/1) ... [2024-10-11 04:13:01,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:13:03,288 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.11.cil-2.c[376251,376264] [2024-10-11 04:13:03,324 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.11.cil-2.c[383339,383352] [2024-10-11 04:13:03,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:13:03,623 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:13:04,427 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.11.cil-2.c[376251,376264] [2024-10-11 04:13:04,438 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.11.cil-2.c[383339,383352] [2024-10-11 04:13:04,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:13:04,528 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:13:04,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:04 WrapperNode [2024-10-11 04:13:04,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:13:04,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:13:04,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:13:04,531 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:13:04,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:04" (1/1) ... [2024-10-11 04:13:04,623 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:04" (1/1) ... [2024-10-11 04:13:05,093 INFO L138 Inliner]: procedures = 66, calls = 74, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 13173 [2024-10-11 04:13:05,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:13:05,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:13:05,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:13:05,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:13:05,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:04" (1/1) ... [2024-10-11 04:13:05,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:04" (1/1) ... [2024-10-11 04:13:05,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:04" (1/1) ... [2024-10-11 04:13:05,365 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 04:13:05,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:04" (1/1) ... [2024-10-11 04:13:05,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:04" (1/1) ... [2024-10-11 04:13:05,538 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:04" (1/1) ... [2024-10-11 04:13:05,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:04" (1/1) ... [2024-10-11 04:13:05,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:04" (1/1) ... [2024-10-11 04:13:05,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:04" (1/1) ... [2024-10-11 04:13:05,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:13:05,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:13:05,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:13:05,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:13:05,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:04" (1/1) ... [2024-10-11 04:13:05,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:13:05,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:13:05,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:13:05,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:13:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:13:05,901 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:13:05,901 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:13:05,901 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:13:05,902 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:13:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:13:05,903 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:13:05,907 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:13:05,907 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:13:05,907 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:13:05,907 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:13:05,907 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:13:05,908 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:13:05,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:13:05,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:13:05,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:13:06,161 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:13:06,164 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:13:14,460 INFO L? ?]: Removed 1749 outVars from TransFormulas that were not future-live. [2024-10-11 04:13:14,460 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:13:14,598 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:13:14,598 INFO L314 CfgBuilder]: Removed 15 assume(true) statements. [2024-10-11 04:13:14,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:13:14 BoogieIcfgContainer [2024-10-11 04:13:14,600 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:13:14,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:13:14,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:13:14,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:13:14,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:13:01" (1/3) ... [2024-10-11 04:13:14,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2000cffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:13:14, skipping insertion in model container [2024-10-11 04:13:14,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:13:04" (2/3) ... [2024-10-11 04:13:14,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2000cffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:13:14, skipping insertion in model container [2024-10-11 04:13:14,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:13:14" (3/3) ... [2024-10-11 04:13:14,611 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label41+token_ring.11.cil-2.c [2024-10-11 04:13:14,629 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:13:14,629 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:13:14,861 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:13:14,869 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;@5a3fe9f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:13:14,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:13:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 2448 states, 2414 states have (on average 1.876553438276719) internal successors, (4530), 2417 states have internal predecessors, (4530), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 04:13:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:13:14,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:14,906 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] [2024-10-11 04:13:14,907 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:14,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:14,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1361111705, now seen corresponding path program 1 times [2024-10-11 04:13:14,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:14,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560001191] [2024-10-11 04:13:14,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:14,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:15,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:15,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:13:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:15,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:13:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:15,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:13:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:15,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:13:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:13:15,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:15,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560001191] [2024-10-11 04:13:15,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560001191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:15,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:15,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:13:15,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516208277] [2024-10-11 04:13:15,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:15,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:13:15,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:15,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:13:15,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:13:15,637 INFO L87 Difference]: Start difference. First operand has 2448 states, 2414 states have (on average 1.876553438276719) internal successors, (4530), 2417 states have internal predecessors, (4530), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 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-10-11 04:13:17,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:17,625 INFO L93 Difference]: Finished difference Result 5006 states and 9354 transitions. [2024-10-11 04:13:17,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:13:17,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 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 151 [2024-10-11 04:13:17,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:17,665 INFO L225 Difference]: With dead ends: 5006 [2024-10-11 04:13:17,665 INFO L226 Difference]: Without dead ends: 2564 [2024-10-11 04:13:17,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:13:17,685 INFO L432 NwaCegarLoop]: 4238 mSDtfsCounter, 902 mSDsluCounter, 12182 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 16420 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:17,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 16420 Invalid, 1046 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 04:13:17,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2024-10-11 04:13:17,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2444. [2024-10-11 04:13:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 2411 states have (on average 1.838241393612609) internal successors, (4432), 2413 states have internal predecessors, (4432), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 04:13:17,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 4482 transitions. [2024-10-11 04:13:17,944 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 4482 transitions. Word has length 151 [2024-10-11 04:13:17,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:17,945 INFO L471 AbstractCegarLoop]: Abstraction has 2444 states and 4482 transitions. [2024-10-11 04:13:17,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 3 states have internal predecessors, (141), 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-10-11 04:13:17,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 4482 transitions. [2024-10-11 04:13:17,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:13:17,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:17,950 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] [2024-10-11 04:13:17,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:13:17,951 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:17,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:17,952 INFO L85 PathProgramCache]: Analyzing trace with hash 774771497, now seen corresponding path program 1 times [2024-10-11 04:13:17,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:17,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35805625] [2024-10-11 04:13:17,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:17,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:18,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:18,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:13:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:18,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:13:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:18,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:13:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:18,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:13:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:18,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:13:18,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:18,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35805625] [2024-10-11 04:13:18,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35805625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:18,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:18,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:13:18,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319008733] [2024-10-11 04:13:18,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:18,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:13:18,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:18,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:13:18,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:13:18,412 INFO L87 Difference]: Start difference. First operand 2444 states and 4482 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 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-10-11 04:13:21,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:21,670 INFO L93 Difference]: Finished difference Result 3313 states and 5934 transitions. [2024-10-11 04:13:21,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:13:21,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 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 151 [2024-10-11 04:13:21,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:21,686 INFO L225 Difference]: With dead ends: 3313 [2024-10-11 04:13:21,686 INFO L226 Difference]: Without dead ends: 3007 [2024-10-11 04:13:21,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:13:21,690 INFO L432 NwaCegarLoop]: 4252 mSDtfsCounter, 5325 mSDsluCounter, 12699 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5343 SdHoareTripleChecker+Valid, 16951 SdHoareTripleChecker+Invalid, 2279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:21,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5343 Valid, 16951 Invalid, 2279 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [104 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 04:13:21,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2024-10-11 04:13:21,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2768. [2024-10-11 04:13:21,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2768 states, 2708 states have (on average 1.8172082717872968) internal successors, (4921), 2711 states have internal predecessors, (4921), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (48), 45 states have call predecessors, (48), 45 states have call successors, (48) [2024-10-11 04:13:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 5014 transitions. [2024-10-11 04:13:21,815 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 5014 transitions. Word has length 151 [2024-10-11 04:13:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:21,816 INFO L471 AbstractCegarLoop]: Abstraction has 2768 states and 5014 transitions. [2024-10-11 04:13:21,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 4 states have internal predecessors, (141), 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-10-11 04:13:21,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 5014 transitions. [2024-10-11 04:13:21,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:13:21,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:21,819 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] [2024-10-11 04:13:21,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:13:21,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:21,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:21,821 INFO L85 PathProgramCache]: Analyzing trace with hash 653545645, now seen corresponding path program 1 times [2024-10-11 04:13:21,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:21,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657539550] [2024-10-11 04:13:21,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:21,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:22,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:22,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:13:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:22,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:13:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:22,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:13:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:22,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:13:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:22,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:13:22,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:22,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657539550] [2024-10-11 04:13:22,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657539550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:22,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:22,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:22,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346808124] [2024-10-11 04:13:22,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:22,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:22,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:22,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:22,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:22,232 INFO L87 Difference]: Start difference. First operand 2768 states and 5014 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:13:26,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:26,188 INFO L93 Difference]: Finished difference Result 4098 states and 7236 transitions. [2024-10-11 04:13:26,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:13:26,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:13:26,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:26,216 INFO L225 Difference]: With dead ends: 4098 [2024-10-11 04:13:26,216 INFO L226 Difference]: Without dead ends: 3468 [2024-10-11 04:13:26,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:13:26,222 INFO L432 NwaCegarLoop]: 4390 mSDtfsCounter, 5356 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3461 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5374 SdHoareTripleChecker+Valid, 21646 SdHoareTripleChecker+Invalid, 3520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:26,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5374 Valid, 21646 Invalid, 3520 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 3461 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 04:13:26,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2024-10-11 04:13:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3067. [2024-10-11 04:13:26,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3067 states, 2980 states have (on average 1.7986577181208054) internal successors, (5360), 2984 states have internal predecessors, (5360), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-10-11 04:13:26,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 5495 transitions. [2024-10-11 04:13:26,358 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 5495 transitions. Word has length 151 [2024-10-11 04:13:26,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:26,358 INFO L471 AbstractCegarLoop]: Abstraction has 3067 states and 5495 transitions. [2024-10-11 04:13:26,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:13:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 5495 transitions. [2024-10-11 04:13:26,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:13:26,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:26,361 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] [2024-10-11 04:13:26,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:13:26,362 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:26,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:26,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1328705771, now seen corresponding path program 1 times [2024-10-11 04:13:26,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:26,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516029730] [2024-10-11 04:13:26,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:26,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:26,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:26,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:13:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:26,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:13:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:26,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:13:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:26,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:13:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:13:26,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:26,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516029730] [2024-10-11 04:13:26,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516029730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:26,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:26,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:26,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2381878] [2024-10-11 04:13:26,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:26,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:26,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:26,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:26,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:26,762 INFO L87 Difference]: Start difference. First operand 3067 states and 5495 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:13:30,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:30,288 INFO L93 Difference]: Finished difference Result 5248 states and 9131 transitions. [2024-10-11 04:13:30,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:13:30,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:13:30,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:30,315 INFO L225 Difference]: With dead ends: 5248 [2024-10-11 04:13:30,316 INFO L226 Difference]: Without dead ends: 4319 [2024-10-11 04:13:30,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:13:30,327 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 5354 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3457 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5372 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 3518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:30,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5372 Valid, 21644 Invalid, 3518 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 3457 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 04:13:30,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4319 states. [2024-10-11 04:13:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4319 to 3666. [2024-10-11 04:13:30,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3525 states have (on average 1.7699290780141843) internal successors, (6239), 3531 states have internal predecessors, (6239), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:13:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6462 transitions. [2024-10-11 04:13:30,503 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6462 transitions. Word has length 151 [2024-10-11 04:13:30,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:30,503 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6462 transitions. [2024-10-11 04:13:30,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:13:30,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6462 transitions. [2024-10-11 04:13:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:13:30,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:30,507 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] [2024-10-11 04:13:30,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:13:30,507 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:30,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:30,508 INFO L85 PathProgramCache]: Analyzing trace with hash 380653805, now seen corresponding path program 1 times [2024-10-11 04:13:30,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:30,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094124974] [2024-10-11 04:13:30,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:30,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:30,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:30,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:13:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:30,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:13:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:30,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:13:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:30,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:13:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:30,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:13:30,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:30,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094124974] [2024-10-11 04:13:30,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094124974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:30,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:30,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:30,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714410495] [2024-10-11 04:13:30,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:30,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:30,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:30,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:30,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:30,783 INFO L87 Difference]: Start difference. First operand 3666 states and 6462 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:13:32,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:32,555 INFO L93 Difference]: Finished difference Result 5837 states and 10091 transitions. [2024-10-11 04:13:32,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:13:32,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:13:32,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:32,575 INFO L225 Difference]: With dead ends: 5837 [2024-10-11 04:13:32,575 INFO L226 Difference]: Without dead ends: 4309 [2024-10-11 04:13:32,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:13:32,583 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 4957 mSDsluCounter, 16550 mSDsCounter, 0 mSdLazyCounter, 1769 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4976 SdHoareTripleChecker+Valid, 20742 SdHoareTripleChecker+Invalid, 1832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:32,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4976 Valid, 20742 Invalid, 1832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1769 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:13:32,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2024-10-11 04:13:32,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 3666. [2024-10-11 04:13:32,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3525 states have (on average 1.7685106382978724) internal successors, (6234), 3531 states have internal predecessors, (6234), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:13:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6457 transitions. [2024-10-11 04:13:32,737 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6457 transitions. Word has length 151 [2024-10-11 04:13:32,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:32,738 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6457 transitions. [2024-10-11 04:13:32,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:13:32,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6457 transitions. [2024-10-11 04:13:32,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:13:32,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:32,742 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] [2024-10-11 04:13:32,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:13:32,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:32,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:32,743 INFO L85 PathProgramCache]: Analyzing trace with hash -204117845, now seen corresponding path program 1 times [2024-10-11 04:13:32,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:32,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204980954] [2024-10-11 04:13:32,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:32,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:32,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:32,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:13:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:33,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:13:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:33,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:13:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:33,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:13:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:13:33,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:33,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204980954] [2024-10-11 04:13:33,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204980954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:33,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:33,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:33,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509124028] [2024-10-11 04:13:33,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:33,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:33,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:33,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:33,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:33,068 INFO L87 Difference]: Start difference. First operand 3666 states and 6457 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:13:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:34,691 INFO L93 Difference]: Finished difference Result 5831 states and 10065 transitions. [2024-10-11 04:13:34,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:13:34,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:13:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:34,717 INFO L225 Difference]: With dead ends: 5831 [2024-10-11 04:13:34,717 INFO L226 Difference]: Without dead ends: 4303 [2024-10-11 04:13:34,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:13:34,728 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 5096 mSDsluCounter, 12441 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5115 SdHoareTripleChecker+Valid, 16633 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:34,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5115 Valid, 16633 Invalid, 1669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 04:13:34,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4303 states. [2024-10-11 04:13:34,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4303 to 3666. [2024-10-11 04:13:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3525 states have (on average 1.7670921985815602) internal successors, (6229), 3531 states have internal predecessors, (6229), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:13:34,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6452 transitions. [2024-10-11 04:13:34,883 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6452 transitions. Word has length 151 [2024-10-11 04:13:34,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:34,884 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6452 transitions. [2024-10-11 04:13:34,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:13:34,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6452 transitions. [2024-10-11 04:13:34,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:13:34,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:34,887 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] [2024-10-11 04:13:34,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:13:34,887 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:34,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:34,888 INFO L85 PathProgramCache]: Analyzing trace with hash -638623443, now seen corresponding path program 1 times [2024-10-11 04:13:34,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:34,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021674036] [2024-10-11 04:13:34,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:34,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:34,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:35,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:13:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:35,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:13:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:35,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:13:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:35,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:13:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:35,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:13:35,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:35,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021674036] [2024-10-11 04:13:35,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021674036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:35,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:35,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:35,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042365874] [2024-10-11 04:13:35,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:35,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:35,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:35,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:35,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:35,136 INFO L87 Difference]: Start difference. First operand 3666 states and 6452 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:13:36,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:36,591 INFO L93 Difference]: Finished difference Result 5824 states and 10037 transitions. [2024-10-11 04:13:36,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:13:36,593 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:13:36,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:36,625 INFO L225 Difference]: With dead ends: 5824 [2024-10-11 04:13:36,629 INFO L226 Difference]: Without dead ends: 4296 [2024-10-11 04:13:36,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:13:36,642 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 5100 mSDsluCounter, 12441 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5119 SdHoareTripleChecker+Valid, 16633 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:36,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5119 Valid, 16633 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:13:36,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2024-10-11 04:13:36,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 3666. [2024-10-11 04:13:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3525 states have (on average 1.7656737588652482) internal successors, (6224), 3531 states have internal predecessors, (6224), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:13:36,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6447 transitions. [2024-10-11 04:13:36,791 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6447 transitions. Word has length 151 [2024-10-11 04:13:36,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:36,792 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6447 transitions. [2024-10-11 04:13:36,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:13:36,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6447 transitions. [2024-10-11 04:13:36,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:13:36,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:36,796 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] [2024-10-11 04:13:36,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:13:36,797 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:36,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:36,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1068281749, now seen corresponding path program 1 times [2024-10-11 04:13:36,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:36,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667707187] [2024-10-11 04:13:36,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:36,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:36,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:36,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:13:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:37,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:13:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:37,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:13:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:37,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:13:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:13:37,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:37,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667707187] [2024-10-11 04:13:37,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667707187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:37,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:37,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:37,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308590054] [2024-10-11 04:13:37,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:37,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:37,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:37,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:37,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:37,064 INFO L87 Difference]: Start difference. First operand 3666 states and 6447 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:13:38,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:38,666 INFO L93 Difference]: Finished difference Result 5812 states and 9999 transitions. [2024-10-11 04:13:38,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:13:38,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:13:38,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:38,683 INFO L225 Difference]: With dead ends: 5812 [2024-10-11 04:13:38,683 INFO L226 Difference]: Without dead ends: 4284 [2024-10-11 04:13:38,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:13:38,691 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 5096 mSDsluCounter, 12441 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5115 SdHoareTripleChecker+Valid, 16633 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:38,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5115 Valid, 16633 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:13:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states. [2024-10-11 04:13:38,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 3666. [2024-10-11 04:13:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3525 states have (on average 1.764255319148936) internal successors, (6219), 3531 states have internal predecessors, (6219), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-10-11 04:13:38,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 6442 transitions. [2024-10-11 04:13:38,853 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 6442 transitions. Word has length 151 [2024-10-11 04:13:38,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:38,855 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 6442 transitions. [2024-10-11 04:13:38,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:13:38,855 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 6442 transitions. [2024-10-11 04:13:38,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:13:38,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:38,858 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] [2024-10-11 04:13:38,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:13:38,858 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:38,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:38,859 INFO L85 PathProgramCache]: Analyzing trace with hash -121243863, now seen corresponding path program 1 times [2024-10-11 04:13:38,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:38,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674164591] [2024-10-11 04:13:38,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:38,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:38,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:13:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:13:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:13:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:13:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:13:39,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:39,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674164591] [2024-10-11 04:13:39,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674164591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:39,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:39,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:39,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676468680] [2024-10-11 04:13:39,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:39,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:39,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:39,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:39,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:39,131 INFO L87 Difference]: Start difference. First operand 3666 states and 6442 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:13:42,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:42,567 INFO L93 Difference]: Finished difference Result 7418 states and 12588 transitions. [2024-10-11 04:13:42,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:13:42,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:13:42,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:42,588 INFO L225 Difference]: With dead ends: 7418 [2024-10-11 04:13:42,589 INFO L226 Difference]: Without dead ends: 5890 [2024-10-11 04:13:42,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:13:42,600 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 5325 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3327 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5343 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 3388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:42,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5343 Valid, 21644 Invalid, 3388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3327 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 04:13:42,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5890 states. [2024-10-11 04:13:42,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5890 to 4887. [2024-10-11 04:13:42,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4887 states, 4638 states have (on average 1.7231565329883571) internal successors, (7992), 4648 states have internal predecessors, (7992), 185 states have call successors, (185), 54 states have call predecessors, (185), 62 states have return successors, (220), 192 states have call predecessors, (220), 185 states have call successors, (220) [2024-10-11 04:13:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 8397 transitions. [2024-10-11 04:13:42,848 INFO L78 Accepts]: Start accepts. Automaton has 4887 states and 8397 transitions. Word has length 151 [2024-10-11 04:13:42,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:42,849 INFO L471 AbstractCegarLoop]: Abstraction has 4887 states and 8397 transitions. [2024-10-11 04:13:42,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:13:42,849 INFO L276 IsEmpty]: Start isEmpty. Operand 4887 states and 8397 transitions. [2024-10-11 04:13:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:13:42,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:42,853 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] [2024-10-11 04:13:42,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:13:42,853 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:42,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:42,854 INFO L85 PathProgramCache]: Analyzing trace with hash 740589739, now seen corresponding path program 1 times [2024-10-11 04:13:42,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:42,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585184120] [2024-10-11 04:13:42,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:42,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:42,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:43,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:13:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:43,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:13:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:43,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:13:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:43,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:13:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:13:43,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:43,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585184120] [2024-10-11 04:13:43,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585184120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:43,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:43,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:43,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737006950] [2024-10-11 04:13:43,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:43,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:43,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:43,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:43,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:43,124 INFO L87 Difference]: Start difference. First operand 4887 states and 8397 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:13:46,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:46,466 INFO L93 Difference]: Finished difference Result 11823 states and 19739 transitions. [2024-10-11 04:13:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:13:46,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:13:46,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:46,499 INFO L225 Difference]: With dead ends: 11823 [2024-10-11 04:13:46,499 INFO L226 Difference]: Without dead ends: 9074 [2024-10-11 04:13:46,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:13:46,513 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 5324 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3314 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5342 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 3375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:46,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5342 Valid, 21644 Invalid, 3375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3314 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 04:13:46,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9074 states. [2024-10-11 04:13:46,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9074 to 7326. [2024-10-11 04:13:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7326 states, 6861 states have (on average 1.6802215420492639) internal successors, (11528), 6879 states have internal predecessors, (11528), 345 states have call successors, (345), 102 states have call predecessors, (345), 118 states have return successors, (442), 360 states have call predecessors, (442), 345 states have call successors, (442) [2024-10-11 04:13:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7326 states to 7326 states and 12315 transitions. [2024-10-11 04:13:47,015 INFO L78 Accepts]: Start accepts. Automaton has 7326 states and 12315 transitions. Word has length 151 [2024-10-11 04:13:47,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:47,015 INFO L471 AbstractCegarLoop]: Abstraction has 7326 states and 12315 transitions. [2024-10-11 04:13:47,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:13:47,016 INFO L276 IsEmpty]: Start isEmpty. Operand 7326 states and 12315 transitions. [2024-10-11 04:13:47,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:13:47,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:47,022 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] [2024-10-11 04:13:47,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:13:47,022 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:47,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:47,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1309819159, now seen corresponding path program 1 times [2024-10-11 04:13:47,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:47,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354980941] [2024-10-11 04:13:47,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:47,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:47,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:47,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:13:47,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:47,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:13:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:47,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:13:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:47,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:13:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:13:47,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:47,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354980941] [2024-10-11 04:13:47,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354980941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:47,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:47,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:47,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006341782] [2024-10-11 04:13:47,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:47,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:47,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:47,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:47,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:47,273 INFO L87 Difference]: Start difference. First operand 7326 states and 12315 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:13:50,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:50,977 INFO L93 Difference]: Finished difference Result 20624 states and 34083 transitions. [2024-10-11 04:13:50,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:13:50,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:13:50,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:51,042 INFO L225 Difference]: With dead ends: 20624 [2024-10-11 04:13:51,042 INFO L226 Difference]: Without dead ends: 15436 [2024-10-11 04:13:51,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:13:51,071 INFO L432 NwaCegarLoop]: 4388 mSDtfsCounter, 5323 mSDsluCounter, 17256 mSDsCounter, 0 mSdLazyCounter, 3301 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5341 SdHoareTripleChecker+Valid, 21644 SdHoareTripleChecker+Invalid, 3362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:51,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5341 Valid, 21644 Invalid, 3362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3301 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 04:13:51,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15436 states. [2024-10-11 04:13:51,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15436 to 12219. [2024-10-11 04:13:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12219 states, 11322 states have (on average 1.6447624094682918) internal successors, (18622), 11356 states have internal predecessors, (18622), 665 states have call successors, (665), 198 states have call predecessors, (665), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-10-11 04:13:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12219 states to 12219 states and 20227 transitions. [2024-10-11 04:13:51,997 INFO L78 Accepts]: Start accepts. Automaton has 12219 states and 20227 transitions. Word has length 151 [2024-10-11 04:13:51,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:51,998 INFO L471 AbstractCegarLoop]: Abstraction has 12219 states and 20227 transitions. [2024-10-11 04:13:51,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:13:51,998 INFO L276 IsEmpty]: Start isEmpty. Operand 12219 states and 20227 transitions. [2024-10-11 04:13:52,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:13:52,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:52,007 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] [2024-10-11 04:13:52,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:13:52,007 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:52,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:52,007 INFO L85 PathProgramCache]: Analyzing trace with hash -821772053, now seen corresponding path program 1 times [2024-10-11 04:13:52,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:52,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994296643] [2024-10-11 04:13:52,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:52,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:52,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:52,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:13:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:52,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:13:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:52,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:13:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:52,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:13:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:13:52,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:52,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994296643] [2024-10-11 04:13:52,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994296643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:52,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:52,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:52,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556244205] [2024-10-11 04:13:52,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:52,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:52,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:52,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:52,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:52,257 INFO L87 Difference]: Start difference. First operand 12219 states and 20227 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:13:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:54,565 INFO L93 Difference]: Finished difference Result 25682 states and 42532 transitions. [2024-10-11 04:13:54,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:13:54,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:13:54,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:54,638 INFO L225 Difference]: With dead ends: 25682 [2024-10-11 04:13:54,639 INFO L226 Difference]: Without dead ends: 15601 [2024-10-11 04:13:54,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:13:54,688 INFO L432 NwaCegarLoop]: 4192 mSDtfsCounter, 4956 mSDsluCounter, 16550 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4975 SdHoareTripleChecker+Valid, 20742 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:54,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4975 Valid, 20742 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 04:13:54,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15601 states. [2024-10-11 04:13:55,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15601 to 12219. [2024-10-11 04:13:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12219 states, 11322 states have (on average 1.641847730083024) internal successors, (18589), 11356 states have internal predecessors, (18589), 665 states have call successors, (665), 198 states have call predecessors, (665), 230 states have return successors, (940), 696 states have call predecessors, (940), 665 states have call successors, (940) [2024-10-11 04:13:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12219 states to 12219 states and 20194 transitions. [2024-10-11 04:13:55,519 INFO L78 Accepts]: Start accepts. Automaton has 12219 states and 20194 transitions. Word has length 151 [2024-10-11 04:13:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:55,522 INFO L471 AbstractCegarLoop]: Abstraction has 12219 states and 20194 transitions. [2024-10-11 04:13:55,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:13:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 12219 states and 20194 transitions. [2024-10-11 04:13:55,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:13:55,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:55,537 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] [2024-10-11 04:13:55,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:13:55,537 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:55,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:55,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1914407255, now seen corresponding path program 1 times [2024-10-11 04:13:55,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:55,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520009258] [2024-10-11 04:13:55,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:55,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:55,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:55,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:13:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:55,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:13:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:55,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:13:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:55,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:13:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:13:55,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:55,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520009258] [2024-10-11 04:13:55,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520009258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:55,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:55,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:13:55,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671307767] [2024-10-11 04:13:55,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:55,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:13:55,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:55,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:13:55,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:13:55,789 INFO L87 Difference]: Start difference. First operand 12219 states and 20194 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:14:01,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:14:01,135 INFO L93 Difference]: Finished difference Result 42673 states and 69999 transitions. [2024-10-11 04:14:01,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:14:01,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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 151 [2024-10-11 04:14:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:14:01,275 INFO L225 Difference]: With dead ends: 42673 [2024-10-11 04:14:01,275 INFO L226 Difference]: Without dead ends: 32592 [2024-10-11 04:14:01,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:14:01,323 INFO L432 NwaCegarLoop]: 4386 mSDtfsCounter, 5714 mSDsluCounter, 17251 mSDsCounter, 0 mSdLazyCounter, 3253 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5744 SdHoareTripleChecker+Valid, 21637 SdHoareTripleChecker+Invalid, 3317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:14:01,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5744 Valid, 21637 Invalid, 3317 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [64 Valid, 3253 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 04:14:01,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32592 states. [2024-10-11 04:14:02,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32592 to 22005. [2024-10-11 04:14:02,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22005 states, 20276 states have (on average 1.617330834484119) internal successors, (32793), 20342 states have internal predecessors, (32793), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 454 states have return successors, (2066), 1336 states have call predecessors, (2066), 1273 states have call successors, (2066) [2024-10-11 04:14:03,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22005 states to 22005 states and 36132 transitions. [2024-10-11 04:14:03,019 INFO L78 Accepts]: Start accepts. Automaton has 22005 states and 36132 transitions. Word has length 151 [2024-10-11 04:14:03,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:14:03,020 INFO L471 AbstractCegarLoop]: Abstraction has 22005 states and 36132 transitions. [2024-10-11 04:14:03,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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-10-11 04:14:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 22005 states and 36132 transitions. [2024-10-11 04:14:03,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 04:14:03,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:14:03,035 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] [2024-10-11 04:14:03,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:14:03,035 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:14:03,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:14:03,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1098387755, now seen corresponding path program 1 times [2024-10-11 04:14:03,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:14:03,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610314268] [2024-10-11 04:14:03,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:14:03,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:14:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:03,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:14:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:03,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:14:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:03,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 04:14:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:03,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 04:14:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:03,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 04:14:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:14:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:14:03,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:14:03,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610314268] [2024-10-11 04:14:03,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610314268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:14:03,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:14:03,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:14:03,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307414505] [2024-10-11 04:14:03,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:14:03,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:14:03,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:14:03,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:14:03,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:14:03,266 INFO L87 Difference]: Start difference. First operand 22005 states and 36132 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 5 states have internal predecessors, (141), 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)